

{"id":561,"date":"2022-01-01T19:41:00","date_gmt":"2022-01-02T00:41:00","guid":{"rendered":"https:\/\/sites.temple.edu\/dslab\/?p=561"},"modified":"2023-06-23T10:34:43","modified_gmt":"2023-06-23T14:34:43","slug":"cooperative-path-planning-for-multiple-non-holonomic-vehicles","status":"publish","type":"post","link":"https:\/\/sites.temple.edu\/dslab\/?p=561","title":{"rendered":"Cooperative path planning for multiple non-holonomic vehicles"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-post\" data-elementor-id=\"561\" class=\"elementor elementor-561\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-331aa1bf elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"331aa1bf\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-2d3d68ee\" data-id=\"2d3d68ee\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-561627e0 elementor-widget elementor-widget-text-editor\" data-id=\"561627e0\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p><\/p>\n<p>We present a metric space approach for high-dimensional sample-based trajectory planning. Sample-based methods such as RRT and its variants have been widely used in robotic applications and beyond, but the convergence of such methods is known only for the specific cases of holonomic systems and sub-Riemannian non-holonomic systems. Here, we present a more general theory using a metric-based approach and prove the algorithm&#8217;s convergence for Euclidean and non-Euclidean spaces. The extended convergence theory is valid for joint planning of multiple heterogeneous holonomic or non-holonomic agents in a crowded environment in the presence of obstacles. We demonstrate the method both using abstract metric spaces (<em>l_p <\/em>geometries and fractal Sierpinski gasket) and using a multi-vehicle Reeds-Shepp vehicle system. For multi-vehicle systems, the degree of simultaneous motion can be adjusted by varying t.he metric on the joint state space, and we demonstrate the effects of this choice on the resulting choreographies.<\/p>\n<p><\/p>\n<p><\/p>\n<figure class=\"wp-block-image size-full\"><img fetchpriority=\"high\" decoding=\"async\" width=\"448\" height=\"744\" src=\"https:\/\/sites.temple.edu\/dslab\/files\/2022\/03\/image.png\" alt=\"\" class=\"wp-image-563\" srcset=\"https:\/\/sites.temple.edu\/dslab\/files\/2022\/03\/image.png 448w, https:\/\/sites.temple.edu\/dslab\/files\/2022\/03\/image-181x300.png 181w\" sizes=\"(max-width: 448px) 100vw, 448px\" \/><p><\/p>\n<figcaption>Trajectory planning for two car-like robots in a 100&#215;100<br>cm2 region with obstacles using (a) L1-norm, (c) L2-norm, and<br>(e) L\u221e-norm. We show the starting pose of each vehicle using<br>dashed lines and arrows, and the final pose using solid lines<br>and arrows. Static environmental obstacles are shown as gray<br>boxes. The speed of each vehicle over time is shown in the<br>corresponding figures (b), (d), (f).<\/figcaption>\n<\/figure>\n<p><\/p>\n<p><\/p>\n<p>Publications<\/p>\n<p><\/p>\n<p><\/p>\n<p>A. Lukyanenko and D. Soudbakhsh, \u201cSampling-based multi-agent choreography planning: a metric space approach,\u201d <i>Robotics and Autonomous Systems<\/i>, In Press 2023.<\/p><p>Lukyanenko, A., and Soudbakhsh, D. \u201cSampling-Based Multi-Agent Choreography Planning: A Metric Space Approach,\u201d 2021, arXiv: 2108.03191 [cs.RO]. (download the arxiv version) <a href=\"https:\/\/arxiv.org\/abs\/2108.03191\">https:\/\/arxiv.org\/abs\/2108.03191<\/a><\/p>\n<p><\/p>\n<p><\/p>\n<p>Lukyanenko, A., Camphire, H., Austin, A., Schmidgall, S., and Soudbakhsh, D.\u201dOptimal Localized Trajectory Planning of Multiple Non-holonomic Vehicles,\u201d <em>2021 IEEE Conference on Control Technology and Applications (CCTA)<\/em>, 2021, pp. 820-825, doi: 10.1109\/CCTA48906.2021.9658995.<\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\n<p><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>We present a metric space approach for high-dimensional sample-based trajectory planning. Sample-based methods such as RRT and its variants have been widely used in robotic applications and beyond, but the convergence of such methods is known only for the specific cases of holonomic systems and sub-Riemannian non-holonomic systems. Here, we present a more general theory &hellip; <a href=\"https:\/\/sites.temple.edu\/dslab\/?p=561\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Cooperative path planning for multiple non-holonomic vehicles<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":15647,"featured_media":0,"comment_status":"open","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_themeisle_gutenberg_block_has_review":false,"footnotes":""},"categories":[10],"tags":[],"class_list":["post-561","post","type-post","status-publish","format-standard","hentry","category-research"],"acf":[],"_links":{"self":[{"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/posts\/561","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/users\/15647"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=561"}],"version-history":[{"count":3,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/posts\/561\/revisions"}],"predecessor-version":[{"id":838,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=\/wp\/v2\/posts\/561\/revisions\/838"}],"wp:attachment":[{"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=561"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=561"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.temple.edu\/dslab\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=561"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}