Multi-vehicle path planning in dynamically changing environments
In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths for multiple vehicles with the following properties: (i) bounded curvature (ii) obstacle avoidant (iii) collision free. Our app...
Saved in:
Published in | 2009 IEEE International Conference on Robotics and Automation pp. 2449 - 2454 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.05.2009
|
Subjects | |
Online Access | Get full text |
ISBN | 1424427886 9781424427888 |
ISSN | 1050-4729 |
DOI | 10.1109/ROBOT.2009.5152520 |
Cover
Loading…
Abstract | In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths for multiple vehicles with the following properties: (i) bounded curvature (ii) obstacle avoidant (iii) collision free. Our approach is based on polygonal approximation of a continuous curve. Using this idea, we formulate an arbitrarily fine relaxation of the path planning problem as a nonconvex feasibility optimization problem. Then, we propound a nonsmooth dynamical systems approach to find feasible solutions of this optimization problem. It is shown that the trajectories of the nonsmooth dynamical system always converge to some equilibria that correspond to the set of feasible solutions of the relaxed problem. The proposed framework can handle more complex mission scenarios for multi-vehicle systems such as rendezvous and area coverage. |
---|---|
AbstractList | In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths for multiple vehicles with the following properties: (i) bounded curvature (ii) obstacle avoidant (iii) collision free. Our approach is based on polygonal approximation of a continuous curve. Using this idea, we formulate an arbitrarily fine relaxation of the path planning problem as a nonconvex feasibility optimization problem. Then, we propound a nonsmooth dynamical systems approach to find feasible solutions of this optimization problem. It is shown that the trajectories of the nonsmooth dynamical system always converge to some equilibria that correspond to the set of feasible solutions of the relaxed problem. The proposed framework can handle more complex mission scenarios for multi-vehicle systems such as rendezvous and area coverage. |
Author | Pappas, G. Jadbabaie, A. Motee, N. Ahmadzadeh, A. |
Author_xml | – sequence: 1 givenname: A. surname: Ahmadzadeh fullname: Ahmadzadeh, A. organization: Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA – sequence: 2 givenname: N. surname: Motee fullname: Motee, N. – sequence: 3 givenname: A. surname: Jadbabaie fullname: Jadbabaie, A. organization: Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA – sequence: 4 givenname: G. surname: Pappas fullname: Pappas, G. organization: Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA |
BookMark | eNpFkM1Kw0AURkdswbT2BXSTF0i8dzK_O7X4B5WCdl8mmZtmJJmWJBb69iIWXH2csziLb8YmcR-JsRuEHBHs3cf6cb3JOYDNJUouOVywGQouBNfGist_MGrCEgQJmdDcTlliIVMCUJorthiGLwBArUSBRcLu37_bMWRHakLVUnpwY5MeWhdjiLs0xNSfoutC5dr2lFaNi7tfT_EY-n3sKI7DNZvWrh1ocd45-3x-2ixfs9X65W35sMqChTGrrZZWcS_JlGVVGYXIBdTCKI1Q8FKh17ICob3zVinjSy8NkaJCkyZRzNntXzUQ0fbQh871p-35h-IHX71PaQ |
ContentType | Conference Proceeding |
DBID | 6IE 6IH CBEJK RIE RIO |
DOI | 10.1109/ROBOT.2009.5152520 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISBN | 1424427894 9781424427895 |
EndPage | 2454 |
ExternalDocumentID | 5152520 |
Genre | orig-research |
GroupedDBID | 29O 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI OCL RIE RIL RIO RNS |
ID | FETCH-LOGICAL-i90t-f975962d5e8bbcc8611240f48671032b61d75c047dad9668dbd58ee6e37e7e43 |
IEDL.DBID | RIE |
ISBN | 1424427886 9781424427888 |
ISSN | 1050-4729 |
IngestDate | Wed Aug 27 02:00:58 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | false |
LCCN | 90-640158 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i90t-f975962d5e8bbcc8611240f48671032b61d75c047dad9668dbd58ee6e37e7e43 |
PageCount | 6 |
ParticipantIDs | ieee_primary_5152520 |
PublicationCentury | 2000 |
PublicationDate | 2009-May |
PublicationDateYYYYMMDD | 2009-05-01 |
PublicationDate_xml | – month: 05 year: 2009 text: 2009-May |
PublicationDecade | 2000 |
PublicationTitle | 2009 IEEE International Conference on Robotics and Automation |
PublicationTitleAbbrev | ROBOT |
PublicationYear | 2009 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
SSID | ssj0001764313 ssj0003366 |
Score | 1.5041184 |
Snippet | In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 2449 |
SubjectTerms | Control systems Force control Joining processes Kinematics Navigation Path planning Robot control Robotics and automation Systems engineering and theory Vehicles |
Title | Multi-vehicle path planning in dynamically changing environments |
URI | https://ieeexplore.ieee.org/document/5152520 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwFA5zJ734YxN_k4NHs6VtmqQ3URxDmBOdsNtoklccjm5IJ-hfb5K22xQP3tpAafN49L2X977vQ-jSJDLMNNPWeakkTMmMpEaHRAujXMRJuXJ458ED77-w-3E8bqCrFRYGAPzwGXTcpe_lm7leuqOybuzEekJboG_Zwq3Eaq3PU4SNrcH6LxxFvk9p0wdKmM0ga1BXaB_lNddTdS9rNA1Nuk_Dm-Go5LGsXvdDd8WHnd4uGtQfXE6bvHWWheror19cjv_d0R5qrwF--HEVuvZRA_IDtLPBTdhC1x6aSz7g1XkWdsrFeFEpHOFpjk0pZZ_OZp_Yo4fd-iZsro2ee3ej2z6p5BbINKEFyRLhlHhMDFIprSW3mRijmWPkc6R7igdGxJoyYVJjayRplIklAIdIgAAWHaJmPs_hCOEojMHuK4mCjLMAlAJpra1DkaSaCiGOUctZYrIo-TQmlRFO_l4-RdtlB8cNGZ6hZvG-hHObCBTqwnvAN5oYqzE |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB1V5QBcWFrETg4ccZvFiZ0bAlEV6IKgSL1VsT1RK6q0QikSfD12lrYgDtwSXxKPRp4Zz7z3AC5VyN1YUqmd1-aECh6TSEmXSKaEiThRIAzeudsL2q_0YegPK3C1xMIgYjZ8hg3zmPXy1UwuzFVZ0zdiPa4u0Dd03KdhjtZa3agwHV2d1TnseVmnUicQNqE6hyxhXa6u-oKS7al45yWexg6bz_2b_iBnsiw--EN5JQs8rR3olr-cz5u8NRapaMivX2yO_93TLtRXED_raRm89qCCyT5sr7ET1uA6A-eSDxwb37KMdrE1LzSOrEliqVzMPppOP60MP2zW14FzdXhp3Q1u26QQXCCT0E5JHDKjxaN85EJIyQOdi1E7Npx8hnZPBI5ivrQpU5HSVRJXQvkcMUCPIUPqHUA1mSV4CJbn-qj3FXpOHFAHhUCurS1dFkbSZowdQc1YYjTPGTVGhRGO_16-gM32oNsZde57jyewlfdzzMjhKVTT9wWe6bQgFeeZN3wD0HOugQ |
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=2009+IEEE+International+Conference+on+Robotics+and+Automation&rft.atitle=Multi-vehicle+path+planning+in+dynamically+changing+environments&rft.au=Ahmadzadeh%2C+A.&rft.au=Motee%2C+N.&rft.au=Jadbabaie%2C+A.&rft.au=Pappas%2C+G.&rft.date=2009-05-01&rft.pub=IEEE&rft.isbn=1424427886&rft.issn=1050-4729&rft.spage=2449&rft.epage=2454&rft_id=info:doi/10.1109%2FROBOT.2009.5152520&rft.externalDocID=5152520 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1050-4729&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1050-4729&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1050-4729&client=summon |