A general framework for task-constrained motion planning with moving obstacles
Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging pro...
Gespeichert in:
Veröffentlicht in: | Robotica 2019-03, Vol.37 (3), p.575-598 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 598 |
---|---|
container_issue | 3 |
container_start_page | 575 |
container_title | Robotica |
container_volume | 37 |
creator | Cefalo, Massimo Oriolo, Giuseppe |
description | Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging problem, whose solution must be sought in the robot state space extended with time. We describe a general planning framework which can be tailored to robots described by either kinematic or dynamic models. The main component is a control-based scheme for producing configuration space subtrajectories along which the task constraint is continuously satisfied. The geometric motion and time history along each subtrajectory are generated separately in order to guarantee feasibility of the latter and at the same time make the scheme intrinsically more flexible. A randomized algorithm then explores the search space by repeatedly invoking the motion generation scheme and checking the produced subtrajectories for collisions. The proposed framework is shown to provide a probabilistically complete planner both in the kinematic and the dynamic case. Modified versions of the planners based on the exploration–exploitation approach are also devised to improve search efficiency or optimize a performance criterion along the solution. We present results in various scenarios involving non-holonomic mobile robots and fixed-based manipulators to show the performance of the planner. |
doi_str_mv | 10.1017/S0263574718001182 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2169242870</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0263574718001182</cupid><sourcerecordid>2169242870</sourcerecordid><originalsourceid>FETCH-LOGICAL-c317t-f85155204b7ec6740f955506a608acc80eea56b3297656e03255f9d30cec90963</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWKs_wF3A9ehNMnnMshRfUHShrodMmtRpZ5KapBb_vTNUcCGu7uWe75wLB6FLAtcEiLx5ASoYl6UkCoAQRY_QhJSiKpQQ6hhNRrkY9VN0ltJ6YBgp5QQ9zfDKeht1h13Uvd2HuMEuRJx12hQm-JSjbr1d4j7kNni87bT3rV_hfZvfh-PnuIcmZW06m87RidNdshc_c4re7m5f5w_F4vn-cT5bFIYRmQunOOGcQtlIa4QswVWccxBagNLGKLBWc9EwWknBhQVGOXfVkoGxpoJKsCm6OuRuY_jY2ZTrddhFP7ysKREVLamSMFDkQJkYUorW1dvY9jp-1QTqsbb6T22Dh_14dN_Edrmyv9H_u74BAQ5uMQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2169242870</pqid></control><display><type>article</type><title>A general framework for task-constrained motion planning with moving obstacles</title><source>Cambridge University Press Journals</source><creator>Cefalo, Massimo ; Oriolo, Giuseppe</creator><creatorcontrib>Cefalo, Massimo ; Oriolo, Giuseppe</creatorcontrib><description>Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging problem, whose solution must be sought in the robot state space extended with time. We describe a general planning framework which can be tailored to robots described by either kinematic or dynamic models. The main component is a control-based scheme for producing configuration space subtrajectories along which the task constraint is continuously satisfied. The geometric motion and time history along each subtrajectory are generated separately in order to guarantee feasibility of the latter and at the same time make the scheme intrinsically more flexible. A randomized algorithm then explores the search space by repeatedly invoking the motion generation scheme and checking the produced subtrajectories for collisions. The proposed framework is shown to provide a probabilistically complete planner both in the kinematic and the dynamic case. Modified versions of the planners based on the exploration–exploitation approach are also devised to improve search efficiency or optimize a performance criterion along the solution. We present results in various scenarios involving non-holonomic mobile robots and fixed-based manipulators to show the performance of the planner.</description><identifier>ISSN: 0263-5747</identifier><identifier>EISSN: 1469-8668</identifier><identifier>DOI: 10.1017/S0263574718001182</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Collision avoidance ; Collision dynamics ; Dynamic models ; Kinematics ; Motion planning ; Moving obstacles ; Robot arms ; Robots</subject><ispartof>Robotica, 2019-03, Vol.37 (3), p.575-598</ispartof><rights>Copyright © Cambridge University Press 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c317t-f85155204b7ec6740f955506a608acc80eea56b3297656e03255f9d30cec90963</citedby><cites>FETCH-LOGICAL-c317t-f85155204b7ec6740f955506a608acc80eea56b3297656e03255f9d30cec90963</cites><orcidid>0000-0001-6153-9278</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0263574718001182/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,780,784,27924,27925,55628</link.rule.ids></links><search><creatorcontrib>Cefalo, Massimo</creatorcontrib><creatorcontrib>Oriolo, Giuseppe</creatorcontrib><title>A general framework for task-constrained motion planning with moving obstacles</title><title>Robotica</title><addtitle>Robotica</addtitle><description>Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging problem, whose solution must be sought in the robot state space extended with time. We describe a general planning framework which can be tailored to robots described by either kinematic or dynamic models. The main component is a control-based scheme for producing configuration space subtrajectories along which the task constraint is continuously satisfied. The geometric motion and time history along each subtrajectory are generated separately in order to guarantee feasibility of the latter and at the same time make the scheme intrinsically more flexible. A randomized algorithm then explores the search space by repeatedly invoking the motion generation scheme and checking the produced subtrajectories for collisions. The proposed framework is shown to provide a probabilistically complete planner both in the kinematic and the dynamic case. Modified versions of the planners based on the exploration–exploitation approach are also devised to improve search efficiency or optimize a performance criterion along the solution. We present results in various scenarios involving non-holonomic mobile robots and fixed-based manipulators to show the performance of the planner.</description><subject>Collision avoidance</subject><subject>Collision dynamics</subject><subject>Dynamic models</subject><subject>Kinematics</subject><subject>Motion planning</subject><subject>Moving obstacles</subject><subject>Robot arms</subject><subject>Robots</subject><issn>0263-5747</issn><issn>1469-8668</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kEtLAzEUhYMoWKs_wF3A9ehNMnnMshRfUHShrodMmtRpZ5KapBb_vTNUcCGu7uWe75wLB6FLAtcEiLx5ASoYl6UkCoAQRY_QhJSiKpQQ6hhNRrkY9VN0ltJ6YBgp5QQ9zfDKeht1h13Uvd2HuMEuRJx12hQm-JSjbr1d4j7kNni87bT3rV_hfZvfh-PnuIcmZW06m87RidNdshc_c4re7m5f5w_F4vn-cT5bFIYRmQunOOGcQtlIa4QswVWccxBagNLGKLBWc9EwWknBhQVGOXfVkoGxpoJKsCm6OuRuY_jY2ZTrddhFP7ysKREVLamSMFDkQJkYUorW1dvY9jp-1QTqsbb6T22Dh_14dN_Edrmyv9H_u74BAQ5uMQ</recordid><startdate>201903</startdate><enddate>201903</enddate><creator>Cefalo, Massimo</creator><creator>Oriolo, Giuseppe</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>F28</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-6153-9278</orcidid></search><sort><creationdate>201903</creationdate><title>A general framework for task-constrained motion planning with moving obstacles</title><author>Cefalo, Massimo ; Oriolo, Giuseppe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c317t-f85155204b7ec6740f955506a608acc80eea56b3297656e03255f9d30cec90963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Collision avoidance</topic><topic>Collision dynamics</topic><topic>Dynamic models</topic><topic>Kinematics</topic><topic>Motion planning</topic><topic>Moving obstacles</topic><topic>Robot arms</topic><topic>Robots</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cefalo, Massimo</creatorcontrib><creatorcontrib>Oriolo, Giuseppe</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><jtitle>Robotica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cefalo, Massimo</au><au>Oriolo, Giuseppe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A general framework for task-constrained motion planning with moving obstacles</atitle><jtitle>Robotica</jtitle><addtitle>Robotica</addtitle><date>2019-03</date><risdate>2019</risdate><volume>37</volume><issue>3</issue><spage>575</spage><epage>598</epage><pages>575-598</pages><issn>0263-5747</issn><eissn>1469-8668</eissn><abstract>Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging problem, whose solution must be sought in the robot state space extended with time. We describe a general planning framework which can be tailored to robots described by either kinematic or dynamic models. The main component is a control-based scheme for producing configuration space subtrajectories along which the task constraint is continuously satisfied. The geometric motion and time history along each subtrajectory are generated separately in order to guarantee feasibility of the latter and at the same time make the scheme intrinsically more flexible. A randomized algorithm then explores the search space by repeatedly invoking the motion generation scheme and checking the produced subtrajectories for collisions. The proposed framework is shown to provide a probabilistically complete planner both in the kinematic and the dynamic case. Modified versions of the planners based on the exploration–exploitation approach are also devised to improve search efficiency or optimize a performance criterion along the solution. We present results in various scenarios involving non-holonomic mobile robots and fixed-based manipulators to show the performance of the planner.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0263574718001182</doi><tpages>24</tpages><orcidid>https://orcid.org/0000-0001-6153-9278</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0263-5747 |
ispartof | Robotica, 2019-03, Vol.37 (3), p.575-598 |
issn | 0263-5747 1469-8668 |
language | eng |
recordid | cdi_proquest_journals_2169242870 |
source | Cambridge University Press Journals |
subjects | Collision avoidance Collision dynamics Dynamic models Kinematics Motion planning Moving obstacles Robot arms Robots |
title | A general framework for task-constrained motion planning with moving obstacles |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T21%3A06%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20general%20framework%20for%20task-constrained%20motion%20planning%20with%20moving%20obstacles&rft.jtitle=Robotica&rft.au=Cefalo,%20Massimo&rft.date=2019-03&rft.volume=37&rft.issue=3&rft.spage=575&rft.epage=598&rft.pages=575-598&rft.issn=0263-5747&rft.eissn=1469-8668&rft_id=info:doi/10.1017/S0263574718001182&rft_dat=%3Cproquest_cross%3E2169242870%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2169242870&rft_id=info:pmid/&rft_cupid=10_1017_S0263574718001182&rfr_iscdi=true |