RRT Guided Model Predictive Path Integral Method

This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tao, Chuyuan, Kim, Hunmin, Hovakimyan, Naira
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Tao, Chuyuan
Kim, Hunmin
Hovakimyan, Naira
description This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value of the random control distribution in the MPPI algorithm, resulting in satisfactory control performance in static and dynamic environments without a need for fine parameter tuning. We also discuss the importance of choosing the right mean of the MPPI algorithm, which balances exploration and optimality gap, given a fixed sample size. In particular, a sufficiently large mean is required to explore the state space enough, and a sufficiently small mean is required to guarantee that the samples reconstruct the optimal controls. The proposed methodology automates the procedure of choosing the right mean by incorporating the RRT algorithm. The simulations demonstrate that the proposed algorithm can solve the motion planning problem in real-time for static or dynamic environments.
doi_str_mv 10.48550/arxiv.2301.13143
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2301_13143</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2301_13143</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-fbf461389e288caa3d7bc3d326bbec5b38094191e90be0ef7d0c8502f955a2ff3</originalsourceid><addsrcrecordid>eNotzrFOwzAQgGEvDKjlAZjwCyQ9--LEHqsKSqVWVFX26GyfqaVAkRsqeHtEYfq3X58Q9wrqxhoDCypf-VJrBFUrVA3eCjgcern-zJGj3J0ij3JfOOYw5QvLPU1HuXmf-LXQKHc8HU9xLm4SjWe---9M9E-P_eq52r6sN6vltqK2wyr51LQKrWNtbSDC2PmAEXXrPQfj0YJrlFPswDNw6iIEa0AnZwzplHAmHv62V_LwUfIble_hlz5c6fgDrzU9Xw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>RRT Guided Model Predictive Path Integral Method</title><source>arXiv.org</source><creator>Tao, Chuyuan ; Kim, Hunmin ; Hovakimyan, Naira</creator><creatorcontrib>Tao, Chuyuan ; Kim, Hunmin ; Hovakimyan, Naira</creatorcontrib><description>This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value of the random control distribution in the MPPI algorithm, resulting in satisfactory control performance in static and dynamic environments without a need for fine parameter tuning. We also discuss the importance of choosing the right mean of the MPPI algorithm, which balances exploration and optimality gap, given a fixed sample size. In particular, a sufficiently large mean is required to explore the state space enough, and a sufficiently small mean is required to guarantee that the samples reconstruct the optimal controls. The proposed methodology automates the procedure of choosing the right mean by incorporating the RRT algorithm. The simulations demonstrate that the proposed algorithm can solve the motion planning problem in real-time for static or dynamic environments.</description><identifier>DOI: 10.48550/arxiv.2301.13143</identifier><language>eng</language><subject>Computer Science - Robotics ; Computer Science - Systems and Control</subject><creationdate>2023-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2301.13143$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2301.13143$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Tao, Chuyuan</creatorcontrib><creatorcontrib>Kim, Hunmin</creatorcontrib><creatorcontrib>Hovakimyan, Naira</creatorcontrib><title>RRT Guided Model Predictive Path Integral Method</title><description>This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value of the random control distribution in the MPPI algorithm, resulting in satisfactory control performance in static and dynamic environments without a need for fine parameter tuning. We also discuss the importance of choosing the right mean of the MPPI algorithm, which balances exploration and optimality gap, given a fixed sample size. In particular, a sufficiently large mean is required to explore the state space enough, and a sufficiently small mean is required to guarantee that the samples reconstruct the optimal controls. The proposed methodology automates the procedure of choosing the right mean by incorporating the RRT algorithm. The simulations demonstrate that the proposed algorithm can solve the motion planning problem in real-time for static or dynamic environments.</description><subject>Computer Science - Robotics</subject><subject>Computer Science - Systems and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFOwzAQgGEvDKjlAZjwCyQ9--LEHqsKSqVWVFX26GyfqaVAkRsqeHtEYfq3X58Q9wrqxhoDCypf-VJrBFUrVA3eCjgcern-zJGj3J0ij3JfOOYw5QvLPU1HuXmf-LXQKHc8HU9xLm4SjWe---9M9E-P_eq52r6sN6vltqK2wyr51LQKrWNtbSDC2PmAEXXrPQfj0YJrlFPswDNw6iIEa0AnZwzplHAmHv62V_LwUfIble_hlz5c6fgDrzU9Xw</recordid><startdate>20230130</startdate><enddate>20230130</enddate><creator>Tao, Chuyuan</creator><creator>Kim, Hunmin</creator><creator>Hovakimyan, Naira</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230130</creationdate><title>RRT Guided Model Predictive Path Integral Method</title><author>Tao, Chuyuan ; Kim, Hunmin ; Hovakimyan, Naira</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-fbf461389e288caa3d7bc3d326bbec5b38094191e90be0ef7d0c8502f955a2ff3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Robotics</topic><topic>Computer Science - Systems and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Tao, Chuyuan</creatorcontrib><creatorcontrib>Kim, Hunmin</creatorcontrib><creatorcontrib>Hovakimyan, Naira</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tao, Chuyuan</au><au>Kim, Hunmin</au><au>Hovakimyan, Naira</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>RRT Guided Model Predictive Path Integral Method</atitle><date>2023-01-30</date><risdate>2023</risdate><abstract>This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value of the random control distribution in the MPPI algorithm, resulting in satisfactory control performance in static and dynamic environments without a need for fine parameter tuning. We also discuss the importance of choosing the right mean of the MPPI algorithm, which balances exploration and optimality gap, given a fixed sample size. In particular, a sufficiently large mean is required to explore the state space enough, and a sufficiently small mean is required to guarantee that the samples reconstruct the optimal controls. The proposed methodology automates the procedure of choosing the right mean by incorporating the RRT algorithm. The simulations demonstrate that the proposed algorithm can solve the motion planning problem in real-time for static or dynamic environments.</abstract><doi>10.48550/arxiv.2301.13143</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2301.13143
ispartof
issn
language eng
recordid cdi_arxiv_primary_2301_13143
source arXiv.org
subjects Computer Science - Robotics
Computer Science - Systems and Control
title RRT Guided Model Predictive Path Integral Method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T18%3A55%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=RRT%20Guided%20Model%20Predictive%20Path%20Integral%20Method&rft.au=Tao,%20Chuyuan&rft.date=2023-01-30&rft_id=info:doi/10.48550/arxiv.2301.13143&rft_dat=%3Carxiv_GOX%3E2301_13143%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true