Asymptotically Optimal Lazy Lifelong Sampling-based Algorithm for Efficient Motion Planning in Dynamic Environments

The paper introduces an asymptotically optimal lifelong sampling-based path planning algorithm that combines the merits of lifelong planning algorithms and lazy search algorithms for rapid replanning in dynamic environments where edge evaluation is expensive. By evaluating only sub-path candidates f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the ... IEEE/RSJ International Conference on Intelligent Robots and Systems S. 8861 - 8867
Hauptverfasser: Huang, Lu, Jing, Xingjian
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 14.10.2024
Schlagworte:
ISSN:2153-0866
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The paper introduces an asymptotically optimal lifelong sampling-based path planning algorithm that combines the merits of lifelong planning algorithms and lazy search algorithms for rapid replanning in dynamic environments where edge evaluation is expensive. By evaluating only sub-path candidates for the optimal solution, the algorithm saves considerable evaluation time and thereby reduces the overall planning cost. It employs a novel informed rewiring cascade to efficiently repair the search tree when the underlying search graph changes. Simulation results demonstrate that the algorithm outperforms various state-of-the-art sampling-based planners in addressing both static and dynamic motion planning problems.
AbstractList The paper introduces an asymptotically optimal lifelong sampling-based path planning algorithm that combines the merits of lifelong planning algorithms and lazy search algorithms for rapid replanning in dynamic environments where edge evaluation is expensive. By evaluating only sub-path candidates for the optimal solution, the algorithm saves considerable evaluation time and thereby reduces the overall planning cost. It employs a novel informed rewiring cascade to efficiently repair the search tree when the underlying search graph changes. Simulation results demonstrate that the algorithm outperforms various state-of-the-art sampling-based planners in addressing both static and dynamic motion planning problems.
Author Huang, Lu
Jing, Xingjian
Author_xml – sequence: 1
  givenname: Lu
  surname: Huang
  fullname: Huang, Lu
  email: lhuang98-c@my.cityu.edu.hk
  organization: City University of Hongkong,Department of Mechanical Engineering,Kowloon,Hong Kong SAR
– sequence: 2
  givenname: Xingjian
  surname: Jing
  fullname: Jing, Xingjian
  email: xingjing@cityu.edu.hk
  organization: City University of Hongkong,Department of Mechanical Engineering,Kowloon,Hong Kong SAR
BookMark eNo1kF1LwzAYRqMoOOf-gWD-QOf7JstHL8fcdFCZOL0eWZvMSJqWpgj111tQr56bw4HzXJOL2ERLyB3CHBHy--3rbi-0yNmcAVvMETQwKdQZmeUq11wAV0qBOCcThoJnoKW8IrOUPgEAYURyOSFpmYa67ZvelyaEge7a3tcm0MJ8D7TwzoYmnuje1G3w8ZQdTbIVXYZT0_n-o6au6ejaOV96G3v6PGqaSF-CiXGkqY_0YYim9iVdxy_fNbEesXRDLp0Jyc7-dkreN-u31VNW7B63q2WReVSyzyqbS6WNAIaIGpzUYJ3h4sg1Wo2cO1mxY8mVVBWi067SrGQLoZVecO2QT8ntr9dbaw9tN4Z1w-H_J_4DbApf7g
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/IROS58592.2024.10802657
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9798350377705
EISSN 2153-0866
EndPage 8867
ExternalDocumentID 10802657
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IL
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i176t-de9678a50211180f680efa35b381e8133f6d2bc3767d11f8fd82c245878438f13
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001433985300155&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:29:35 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i176t-de9678a50211180f680efa35b381e8133f6d2bc3767d11f8fd82c245878438f13
PageCount 7
ParticipantIDs ieee_primary_10802657
PublicationCentury 2000
PublicationDate 2024-Oct.-14
PublicationDateYYYYMMDD 2024-10-14
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-Oct.-14
  day: 14
PublicationDecade 2020
PublicationTitle Proceedings of the ... IEEE/RSJ International Conference on Intelligent Robots and Systems
PublicationTitleAbbrev IROS
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001079896
Score 2.2706492
Snippet The paper introduces an asymptotically optimal lifelong sampling-based path planning algorithm that combines the merits of lifelong planning algorithms and...
SourceID ieee
SourceType Publisher
StartPage 8861
SubjectTerms asymptotically optimal
Costs
dynamic environments
Dynamics
Heuristic algorithms
Intelligent robots
lazy search
lifelong planning
Maintenance engineering
Motion planning
Path planning
Planning
sampling-based
Simulation
Title Asymptotically Optimal Lazy Lifelong Sampling-based Algorithm for Efficient Motion Planning in Dynamic Environments
URI https://ieeexplore.ieee.org/document/10802657
WOSCitedRecordID wos001433985300155&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na8IwGA5Tdtgu-3Lsmxx2rTZt0yRH2ZQNnMrcwJvEfLhCP0TrwP36JVGnO-yw0kMJNIQE8rx58z7PA8A9F4IqYo4lTPu-FykReCwKkCeIebB9sXRmE6TbpcMh66_J6o4Lo5RyxWeqbj_dXb4sxMKmyhq2Hi6IMamACiHxiqy1Taj4hFEWr2u4kM8az6-9gYmGmeVbBVF98_cvHxUHI-2jfw7gGNS2hDzY_4GaE7Cn8lNwuKMleAbmzfkym5aFy02nS9gze0HGU9jhX0vYSbRKi3wCB9xWkOcTz6KXhM10UsyS8iODJnaFLScnYUYAX5y3D9w4GsEkh48r63rY2mHG1cB7u_X28OStHRW8BJG49KRiBpw4NsBupd90TH2leYjHBrcVNcdVHctgLKzCi0RIUy1pIIIIU0KjkGoUnoNqXuTqAkDBQ2LCL-lCrtjsVaZbyjDlWlMyRugS1Oz8jaYr0YzRZuqu_mi_Bgd2lSwsoOgGVMvZQt2CffFZJvPZnVvqbyoTqeo
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGG4UTdSLXxi_7cHrYO3WtT0ShWDkK4IJNzK6FpeMjcAwwV9vW0Dw4MFlh6XJmqZN-rx9-z7PA8BjKASTVB9LuHJdx5cCO9zHyBFUP8S8JLJmE7TVYv0-76zI6pYLI6W0xWeyZD7tXX6UiblJlZVNPRwOCN0Fe8T3sbuka21SKi7ljAerKi7k8vLLW7ur42FuGFfYL63__-WkYoGkdvzPIZyA4oaSBzs_YHMKdmR6Bo621ATPwawyW4wneWaz08kCtvVuMA4T2Ai_FrARK5lk6Qh2Q1NDno4cg18RrCSjbBrnH2Ooo1dYtYISegSwad194NrTCMYpfF6a18PqFjeuCN5r1d5T3Vl5KjgxokHuRJJreAqJhnYj_qYC5koVemSokVsyfWBVQYSHwmi8RAgppiKGBfYJo8z3mELeBSikWSovARShR3UAFtmgK9C7le6WccJCpRgdInQFimb-BpOlbMZgPXXXf7Q_gIN6r9kYNF5arzfg0KyYAQnk34JCPp3LO7AvPvN4Nr23y_4NLYGtMQ
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%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+...+IEEE%2FRSJ+International+Conference+on+Intelligent+Robots+and+Systems&rft.atitle=Asymptotically+Optimal+Lazy+Lifelong+Sampling-based+Algorithm+for+Efficient+Motion+Planning+in+Dynamic+Environments&rft.au=Huang%2C+Lu&rft.au=Jing%2C+Xingjian&rft.date=2024-10-14&rft.pub=IEEE&rft.eissn=2153-0866&rft.spage=8861&rft.epage=8867&rft_id=info:doi/10.1109%2FIROS58592.2024.10802657&rft.externalDocID=10802657