SOF-RRT: An improved path planning algorithm using spatial offset sampling

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering applications of artificial intelligence Ročník 126; s. 106875
Hlavní autoři: Yu, Shanen, Chen, Jianke, Liu, Guangyu, Tong, Xiaolong, Sun, Yingyi
Médium: Journal Article
Jazyk:angličtina
Vydáno: 01.11.2023
ISSN:0952-1976
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
ArticleNumber 106875
Author Yu, Shanen
Sun, Yingyi
Liu, Guangyu
Tong, Xiaolong
Chen, Jianke
Author_xml – sequence: 1
  givenname: Shanen
  surname: Yu
  fullname: Yu, Shanen
– sequence: 2
  givenname: Jianke
  surname: Chen
  fullname: Chen, Jianke
– sequence: 3
  givenname: Guangyu
  surname: Liu
  fullname: Liu, Guangyu
– sequence: 4
  givenname: Xiaolong
  surname: Tong
  fullname: Tong, Xiaolong
– sequence: 5
  givenname: Yingyi
  surname: Sun
  fullname: Sun, Yingyi
BookMark eNqFkNFKwzAUhnMxwW36CpIX6EyaNm3FmzGcUwaDOa_DSZN0GW0akir49nZMb7zx6nC-n_9w-GZo4nqnEbqjZEEJ5fenhXYNeA92kZKUjZCXRT5BU1LlaUKrgl-jWYwnQggrMz5Fr2-7dbLfHx7w0mHb-dB_aoU9DEfsW3DOugZD2_TBDscOf8TzHsfYQot7Y6IecITOtyO_QVcG2qhvf-Ycva-fDqtNst09v6yW26RmNB2SPAOVlVJCzk2pmAKieSZVkeqSyIKOmBaGqxxAySovailZRomqmCGE1zVnc_R4uVuHPsagjajtMH7UuyGAbQUl4uxCnMSvC3F2IS4uxjr_U_fBdhC-_it-A-znbHw
CitedBy_id crossref_primary_10_1002_rob_70000
crossref_primary_10_1016_j_eswa_2025_128219
crossref_primary_10_1088_1361_6501_ae02af
crossref_primary_10_1016_j_oceaneng_2025_120702
crossref_primary_10_3390_electronics12214455
crossref_primary_10_3390_electronics13050972
crossref_primary_10_1109_ACCESS_2025_3582959
crossref_primary_10_1016_j_oceaneng_2025_121511
crossref_primary_10_1088_2631_8695_adfa6c
crossref_primary_10_1007_s11370_025_00599_w
crossref_primary_10_3934_electreng_2025020
crossref_primary_10_1016_j_engappai_2025_110393
crossref_primary_10_1016_j_eswa_2023_122510
crossref_primary_10_1016_j_heliyon_2024_e32451
crossref_primary_10_1016_j_jocs_2025_102718
crossref_primary_10_1016_j_engappai_2025_110601
Cites_doi 10.1109/ACCESS.2019.2958876
10.1016/j.engappai.2022.105182
10.1016/j.comcom.2020.11.012
10.1177/0278364915615688
10.1109/TASE.2015.2487881
10.1109/ACCESS.2014.2302442
10.1109/TSSC.1968.300136
10.1109/TRO.2004.838026
10.1613/jair.2994
10.1016/j.eswa.2019.01.032
10.1177/0278364911406761
10.1109/4235.585889
10.1016/j.eswa.2021.115457
10.1007/s10846-017-0641-3
10.1002/rob.4620060203
10.1016/j.procs.2018.01.113
10.1007/BF01386390
10.1007/s00170-007-0930-2
10.1109/70.508439
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.engappai.2023.106875
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Computer Science
ExternalDocumentID 10_1016_j_engappai_2023_106875
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
29G
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9DU
9JN
AABNK
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
AAYXX
ABBOA
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFS
ACLOT
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADJOM
ADMUD
ADNMO
ADTZH
AEBSH
AECPX
AEIPS
AEKER
AENEX
AEUPX
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APXCP
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CITATION
CS3
DU5
EBS
EFJIC
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TN5
UHS
WUQ
ZMT
~G-
~HD
ID FETCH-LOGICAL-c312t-54ad48bba56f8d3da0e64bd72e80b71a5617f6d5aadb957cbb3410d93f006cc63
ISICitedReferencesCount 17
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001067284600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0952-1976
IngestDate Sat Nov 29 07:06:17 EST 2025
Tue Nov 18 21:51:40 EST 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c312t-54ad48bba56f8d3da0e64bd72e80b71a5617f6d5aadb957cbb3410d93f006cc63
ParticipantIDs crossref_citationtrail_10_1016_j_engappai_2023_106875
crossref_primary_10_1016_j_engappai_2023_106875
PublicationCentury 2000
PublicationDate 2023-11-00
PublicationDateYYYYMMDD 2023-11-01
PublicationDate_xml – month: 11
  year: 2023
  text: 2023-11-00
PublicationDecade 2020
PublicationTitle Engineering applications of artificial intelligence
PublicationYear 2023
References Elbanhawi (10.1016/j.engappai.2023.106875_b8) 2014; 2
Jeong (10.1016/j.engappai.2023.106875_b15) 2019; 123
Karaman (10.1016/j.engappai.2023.106875_b17) 2011; 30
Amato (10.1016/j.engappai.2023.106875_b2) 1996
Liang (10.1016/j.engappai.2023.106875_b23) 2004
Solovey (10.1016/j.engappai.2023.106875_b25) 2016; 35
Devaurs (10.1016/j.engappai.2023.106875_b6) 2015; 13
Gammell (10.1016/j.engappai.2023.106875_b10) 2014
Daniel (10.1016/j.engappai.2023.106875_b5) 2010; 39
Kang (10.1016/j.engappai.2023.106875_b16) 2008
Khatib (10.1016/j.engappai.2023.106875_b19) 1986
Fan (10.1016/j.engappai.2023.106875_b9) 2022; 114
Jeong (10.1016/j.engappai.2023.106875_b14) 2015
Liao (10.1016/j.engappai.2023.106875_b24) 2021; 184
Yuan (10.1016/j.engappai.2023.106875_b30) 2019; 8
LaValle (10.1016/j.engappai.2023.106875_b22) 1998
Boor (10.1016/j.engappai.2023.106875_b3) 1999
Koenig (10.1016/j.engappai.2023.106875_b20) 2005; 21
Zhong (10.1016/j.engappai.2023.106875_b31) 2012
Hart (10.1016/j.engappai.2023.106875_b12) 1968; 4
Yershova (10.1016/j.engappai.2023.106875_b29) 2005
Xiao (10.1016/j.engappai.2023.106875_b28) 1997; 1
Edsger (10.1016/j.engappai.2023.106875_b7) 1959; 1
Kavraki (10.1016/j.engappai.2023.106875_b18) 1996; 12
Aguinaga (10.1016/j.engappai.2023.106875_b1) 2008; 36
Wang (10.1016/j.engappai.2023.106875_b26) 2021; 166
Ghosh (10.1016/j.engappai.2023.106875_b11) 2019
Hsu (10.1016/j.engappai.2023.106875_b13) 1989; 6
Wang (10.1016/j.engappai.2023.106875_b27) 2018; 90
Brand (10.1016/j.engappai.2023.106875_b4) 2010
Lamini (10.1016/j.engappai.2023.106875_b21) 2018; 127
References_xml – start-page: 113
  year: 1996
  ident: 10.1016/j.engappai.2023.106875_b2
  article-title: A randomized roadmap method for path and manipulation planning
– volume: 8
  start-page: 900
  year: 2019
  ident: 10.1016/j.engappai.2023.106875_b30
  article-title: A heuristic rapidly-exploring random trees method for manipulator motion planning
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2958876
– volume: 114
  year: 2022
  ident: 10.1016/j.engappai.2023.106875_b9
  article-title: UAV trajectory planning in cluttered environments based on PF-RRT* algorithm with goal-biased strategy
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2022.105182
– start-page: 8627
  year: 2019
  ident: 10.1016/j.engappai.2023.106875_b11
  article-title: Kinematic constraints based Bi-directional RRT (KB-RRT) with parameterized trajectories for robot path planning in cluttered environment
– volume: 166
  start-page: 49
  year: 2021
  ident: 10.1016/j.engappai.2023.106875_b26
  article-title: Dynamic path planning for unmanned surface vehicle in complex offshore areas based on hybrid algorithm
  publication-title: Comput. Commun.
  doi: 10.1016/j.comcom.2020.11.012
– start-page: 1018
  year: 1999
  ident: 10.1016/j.engappai.2023.106875_b3
  article-title: The Gaussian sampling strategy for probabilistic roadmap planners
– volume: 35
  start-page: 501
  issue: 5
  year: 2016
  ident: 10.1016/j.engappai.2023.106875_b25
  article-title: Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
  publication-title: Int. J. Robot. Res.
  doi: 10.1177/0278364915615688
– volume: 13
  start-page: 415
  issue: 2
  year: 2015
  ident: 10.1016/j.engappai.2023.106875_b6
  article-title: Optimal path planning in complex cost spaces with sampling-based algorithms
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2015.2487881
– volume: 2
  start-page: 56
  year: 2014
  ident: 10.1016/j.engappai.2023.106875_b8
  article-title: Sampling-based robot motion planning: A review
  publication-title: Ieee Access
  doi: 10.1109/ACCESS.2014.2302442
– volume: 4
  start-page: 100
  issue: 2
  year: 1968
  ident: 10.1016/j.engappai.2023.106875_b12
  article-title: A formal basis for the heuristic determination of minimum cost paths
  publication-title: IEEE Trans. Syst. Sci. Cybern.
  doi: 10.1109/TSSC.1968.300136
– start-page: 3856
  year: 2005
  ident: 10.1016/j.engappai.2023.106875_b29
  article-title: Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain
– volume: 21
  start-page: 354
  issue: 3
  year: 2005
  ident: 10.1016/j.engappai.2023.106875_b20
  article-title: Fast replanning for navigation in unknown terrain
  publication-title: IEEE Trans. Robot.
  doi: 10.1109/TRO.2004.838026
– volume: 39
  start-page: 533
  year: 2010
  ident: 10.1016/j.engappai.2023.106875_b5
  article-title: Theta*: Any-angle path planning on grids
  publication-title: J. Artificial Intelligence Res.
  doi: 10.1613/jair.2994
– start-page: 2997
  year: 2014
  ident: 10.1016/j.engappai.2023.106875_b10
  article-title: Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic
– start-page: 1002
  year: 2008
  ident: 10.1016/j.engappai.2023.106875_b16
  article-title: Path planning algorithm using the particle swarm optimization and the improved Dijkstra algorithm
– year: 1998
  ident: 10.1016/j.engappai.2023.106875_b22
– start-page: 67
  year: 2015
  ident: 10.1016/j.engappai.2023.106875_b14
  article-title: RRT*-quick: A motion planning algorithm with faster convergence rate
– start-page: 188
  year: 2012
  ident: 10.1016/j.engappai.2023.106875_b31
  article-title: Triple-RRTs for robot path planning based on narrow passage identification
– volume: 123
  start-page: 82
  year: 2019
  ident: 10.1016/j.engappai.2023.106875_b15
  article-title: Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2019.01.032
– volume: 30
  start-page: 846
  issue: 7
  year: 2011
  ident: 10.1016/j.engappai.2023.106875_b17
  article-title: Sampling-based algorithms for optimal motion planning
  publication-title: The Int. J. Robot. Res.
  doi: 10.1177/0278364911406761
– volume: 1
  start-page: 18
  issue: 1
  year: 1997
  ident: 10.1016/j.engappai.2023.106875_b28
  article-title: Adaptive evolutionary planner/navigator for mobile robots
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/4235.585889
– volume: 184
  year: 2021
  ident: 10.1016/j.engappai.2023.106875_b24
  article-title: F-RRT*: An improved path planning algorithm with improved initial solution and convergence rate
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2021.115457
– volume: 90
  start-page: 81
  issue: 1
  year: 2018
  ident: 10.1016/j.engappai.2023.106875_b27
  article-title: A learning-based multi-RRT approach for robot path planning in narrow passages
  publication-title: J. Intell. Robot. Syst.
  doi: 10.1007/s10846-017-0641-3
– start-page: V3
  year: 2010
  ident: 10.1016/j.engappai.2023.106875_b4
  article-title: Ant colony optimization algorithm for robot path planning
– volume: 6
  start-page: 133
  issue: 2
  year: 1989
  ident: 10.1016/j.engappai.2023.106875_b13
  article-title: Dynamic control of redundant manipulators
  publication-title: J. Robot. Syst.
  doi: 10.1002/rob.4620060203
– start-page: 396
  year: 1986
  ident: 10.1016/j.engappai.2023.106875_b19
  article-title: Real-time obstacle avoidance for manipulators and mobile robots
– start-page: 688
  year: 2004
  ident: 10.1016/j.engappai.2023.106875_b23
  article-title: Improved artificial potential field for unknown narrow environments
– volume: 127
  start-page: 180
  year: 2018
  ident: 10.1016/j.engappai.2023.106875_b21
  article-title: Genetic algorithm based approach for autonomous mobile robot path planning
  publication-title: Procedia Comput. Sci.
  doi: 10.1016/j.procs.2018.01.113
– volume: 1
  start-page: 269
  issue: 1
  year: 1959
  ident: 10.1016/j.engappai.2023.106875_b7
  article-title: A note on two problems in connexion with graphs
  publication-title: Numer. Math.
  doi: 10.1007/BF01386390
– volume: 36
  start-page: 1221
  issue: 11
  year: 2008
  ident: 10.1016/j.engappai.2023.106875_b1
  article-title: Parallel RRT-based path planning for selective disassembly planning
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-007-0930-2
– volume: 12
  start-page: 566
  issue: 4
  year: 1996
  ident: 10.1016/j.engappai.2023.106875_b18
  article-title: Probabilistic roadmaps for path planning in high-dimensional configuration spaces
  publication-title: IEEE Trans. Robot. Autom.
  doi: 10.1109/70.508439
SSID ssj0003846
Score 2.4662254
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 106875
Title SOF-RRT: An improved path planning algorithm using spatial offset sampling
Volume 126
WOSCitedRecordID wos001067284600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0952-1976
  databaseCode: AIEXJ
  dateStart: 19950201
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0003846
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQcuUF6iQJEP3FZZkthObG6rqlVbVQWVBe0tsuN4m7Kk1SZblV_A38Z27CQ8BPTAJYpGsfOYT-PxZGY-AF4nimCBuAxykeMAJwIFIuQowFSGsVKECltb9ekkPT2liwV7Pxp987Uw16u0qujNDbv6r6rWMq1sUzp7C3V3k2qBPtdK10etdn38J8V_eHcQnJ3NXcSvtEED7VUa6mHDGW0piiZ8tbxcl835l8nGBgtqk1ht_VJVF82k5ibR3C1qPm7fdy6cDH9720yCtU05sgQggx6fnUnZ2CDrOa_6wrM9Xxai8fm5u_KktJdq4FbLr5s-BN5apEXJta12j-VCFTFyNXvDmGMcRKwlfOnMbzw0oHqHSlsqlV9sextmuJgW1VK_JS-n5hbTfsCPzbR_WuS61EOf1XaR-XkyM0_WznMHbMUpYXQMtmZH-4vjblFHtK358m8wKDb__RMN_JyBwzLfBvfdTgPOWoQ8BKOiegQeuF0HdDa91iJP7OFlj8Gxw9BbOKugRxA0CIIeQbBDELQIgg5BsEUQ9Ah6Aj4e7M_3DgNHuhHkKIqbgGAuMRWCk0RRiSQPiwQLmcYFDUUaaXGUqkQSzqVgJM2F0H5QKBlS2n7neYKegnF1WRXPAFQyZEpxwiRROMSCRQxHIiepYCHlSbIDiP9EWe460htilFX2ZyXtgDfduKu2J8tfRjy_9YgX4F6P4Jdg3Kw3xS64m183Zb1-5dDxHepoi-U
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=SOF-RRT%3A+An+improved+path+planning+algorithm+using+spatial+offset+sampling&rft.jtitle=Engineering+applications+of+artificial+intelligence&rft.au=Yu%2C+Shanen&rft.au=Chen%2C+Jianke&rft.au=Liu%2C+Guangyu&rft.au=Tong%2C+Xiaolong&rft.date=2023-11-01&rft.issn=0952-1976&rft.volume=126&rft.spage=106875&rft_id=info:doi/10.1016%2Fj.engappai.2023.106875&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_engappai_2023_106875
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0952-1976&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0952-1976&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0952-1976&client=summon