Loading…
Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization
This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in whic...
Saved in:
Published in: | arXiv.org 2023-06 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Chandra, Rohan Menon, Rahul Sprague, Zayne Arya Anantula Biswas, Joydeep |
description | This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are sufficient for it to plan collision-free trajectories with minimal deviation from their preferred velocities, similar to how humans navigate in these scenarios. We successfully deploy the proposed algorithm in the real world using F\(1/10\) robots, a Clearpath Jackal, and a Boston Dynamics Spot as well as in simulation using the SocialGym 2.0 multi-agent social navigation simulator, in the doorway and corridor intersection scenarios. We compare with state-of-the-art social navigation methods using multi-agent reinforcement learning, collision avoidance algorithms, and crowd simulation models. We show that \((i)\) classical navigation performs \(44\%\) better than the state-of-the-art learning-based social navigation algorithms, \((ii)\) without a scheduling protocol, our approach results in collisions in social mini-games \((iii)\) our approach yields \(2\times\) and \(5\times\) fewer velocity changes than CADRL in doorways and intersections, and finally \((iv)\) bi-level navigation in doorways at a flow rate of \(2.8 - 3.3\) (ms)\(^{-1}\) is comparable to flow rate in human navigation at a flow rate of \(4\) (ms)\(^{-1}\). |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2826543205</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2826543205</sourcerecordid><originalsourceid>FETCH-proquest_journals_28265432053</originalsourceid><addsrcrecordid>eNqNi80KgkAURocgSMp3GGgt2Iya66xoEQb9rGWyW12Z5pozGvj0RfQArT4453wD5gkpZ0EaCTFivrVVGIYimYs4lh47LaEE4xqlsYcLP1CJSvNcdXhTDsnwF7o7z8kEGVENzQd2wPd0Jmd5h4ovMNhCB5rvaocP7L-vCRtelbbg_3bMpuvVMdsEdUPPFqwrKmob81GFSEUSR1KEsfyvegPafEDy</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2826543205</pqid></control><display><type>article</type><title>Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization</title><source>Publicly Available Content Database</source><creator>Chandra, Rohan ; Menon, Rahul ; Sprague, Zayne ; Arya Anantula ; Biswas, Joydeep</creator><creatorcontrib>Chandra, Rohan ; Menon, Rahul ; Sprague, Zayne ; Arya Anantula ; Biswas, Joydeep</creatorcontrib><description>This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are sufficient for it to plan collision-free trajectories with minimal deviation from their preferred velocities, similar to how humans navigate in these scenarios. We successfully deploy the proposed algorithm in the real world using F\(1/10\) robots, a Clearpath Jackal, and a Boston Dynamics Spot as well as in simulation using the SocialGym 2.0 multi-agent social navigation simulator, in the doorway and corridor intersection scenarios. We compare with state-of-the-art social navigation methods using multi-agent reinforcement learning, collision avoidance algorithms, and crowd simulation models. We show that \((i)\) classical navigation performs \(44\%\) better than the state-of-the-art learning-based social navigation algorithms, \((ii)\) without a scheduling protocol, our approach results in collisions in social mini-games \((iii)\) our approach yields \(2\times\) and \(5\times\) fewer velocity changes than CADRL in doorways and intersections, and finally \((iv)\) bi-level navigation in doorways at a flow rate of \(2.8 - 3.3\) (ms)\(^{-1}\) is comparable to flow rate in human navigation at a flow rate of \(4\) (ms)\(^{-1}\).</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Collision avoidance ; Collision dynamics ; Flow velocity ; Game theory ; Games ; Machine learning ; Multiagent systems ; Multiple robots ; Navigation ; Optimization ; Real time ; Robot dynamics ; Simulation models ; Trajectory optimization ; Trajectory planning</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2826543205?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25731,36989,44566</link.rule.ids></links><search><creatorcontrib>Chandra, Rohan</creatorcontrib><creatorcontrib>Menon, Rahul</creatorcontrib><creatorcontrib>Sprague, Zayne</creatorcontrib><creatorcontrib>Arya Anantula</creatorcontrib><creatorcontrib>Biswas, Joydeep</creatorcontrib><title>Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization</title><title>arXiv.org</title><description>This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are sufficient for it to plan collision-free trajectories with minimal deviation from their preferred velocities, similar to how humans navigate in these scenarios. We successfully deploy the proposed algorithm in the real world using F\(1/10\) robots, a Clearpath Jackal, and a Boston Dynamics Spot as well as in simulation using the SocialGym 2.0 multi-agent social navigation simulator, in the doorway and corridor intersection scenarios. We compare with state-of-the-art social navigation methods using multi-agent reinforcement learning, collision avoidance algorithms, and crowd simulation models. We show that \((i)\) classical navigation performs \(44\%\) better than the state-of-the-art learning-based social navigation algorithms, \((ii)\) without a scheduling protocol, our approach results in collisions in social mini-games \((iii)\) our approach yields \(2\times\) and \(5\times\) fewer velocity changes than CADRL in doorways and intersections, and finally \((iv)\) bi-level navigation in doorways at a flow rate of \(2.8 - 3.3\) (ms)\(^{-1}\) is comparable to flow rate in human navigation at a flow rate of \(4\) (ms)\(^{-1}\).</description><subject>Algorithms</subject><subject>Collision avoidance</subject><subject>Collision dynamics</subject><subject>Flow velocity</subject><subject>Game theory</subject><subject>Games</subject><subject>Machine learning</subject><subject>Multiagent systems</subject><subject>Multiple robots</subject><subject>Navigation</subject><subject>Optimization</subject><subject>Real time</subject><subject>Robot dynamics</subject><subject>Simulation models</subject><subject>Trajectory optimization</subject><subject>Trajectory planning</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNi80KgkAURocgSMp3GGgt2Iya66xoEQb9rGWyW12Z5pozGvj0RfQArT4453wD5gkpZ0EaCTFivrVVGIYimYs4lh47LaEE4xqlsYcLP1CJSvNcdXhTDsnwF7o7z8kEGVENzQd2wPd0Jmd5h4ovMNhCB5rvaocP7L-vCRtelbbg_3bMpuvVMdsEdUPPFqwrKmob81GFSEUSR1KEsfyvegPafEDy</recordid><startdate>20230615</startdate><enddate>20230615</enddate><creator>Chandra, Rohan</creator><creator>Menon, Rahul</creator><creator>Sprague, Zayne</creator><creator>Arya Anantula</creator><creator>Biswas, Joydeep</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230615</creationdate><title>Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization</title><author>Chandra, Rohan ; Menon, Rahul ; Sprague, Zayne ; Arya Anantula ; Biswas, Joydeep</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28265432053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Collision avoidance</topic><topic>Collision dynamics</topic><topic>Flow velocity</topic><topic>Game theory</topic><topic>Games</topic><topic>Machine learning</topic><topic>Multiagent systems</topic><topic>Multiple robots</topic><topic>Navigation</topic><topic>Optimization</topic><topic>Real time</topic><topic>Robot dynamics</topic><topic>Simulation models</topic><topic>Trajectory optimization</topic><topic>Trajectory planning</topic><toplevel>online_resources</toplevel><creatorcontrib>Chandra, Rohan</creatorcontrib><creatorcontrib>Menon, Rahul</creatorcontrib><creatorcontrib>Sprague, Zayne</creatorcontrib><creatorcontrib>Arya Anantula</creatorcontrib><creatorcontrib>Biswas, Joydeep</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chandra, Rohan</au><au>Menon, Rahul</au><au>Sprague, Zayne</au><au>Arya Anantula</au><au>Biswas, Joydeep</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization</atitle><jtitle>arXiv.org</jtitle><date>2023-06-15</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>This paper presents a fully decentralized approach for realtime non-cooperative multi-robot navigation in social mini-games, such as navigating through a narrow doorway or negotiating right of way at a corridor intersection. Our contribution is a new realtime bi-level optimization algorithm, in which the top-level optimization consists of computing a fair and collision-free ordering followed by the bottom-level optimization which plans optimal trajectories conditioned on the ordering. We show that, given such a priority order, we can impose simple kinodynamic constraints on each robot that are sufficient for it to plan collision-free trajectories with minimal deviation from their preferred velocities, similar to how humans navigate in these scenarios. We successfully deploy the proposed algorithm in the real world using F\(1/10\) robots, a Clearpath Jackal, and a Boston Dynamics Spot as well as in simulation using the SocialGym 2.0 multi-agent social navigation simulator, in the doorway and corridor intersection scenarios. We compare with state-of-the-art social navigation methods using multi-agent reinforcement learning, collision avoidance algorithms, and crowd simulation models. We show that \((i)\) classical navigation performs \(44\%\) better than the state-of-the-art learning-based social navigation algorithms, \((ii)\) without a scheduling protocol, our approach results in collisions in social mini-games \((iii)\) our approach yields \(2\times\) and \(5\times\) fewer velocity changes than CADRL in doorways and intersections, and finally \((iv)\) bi-level navigation in doorways at a flow rate of \(2.8 - 3.3\) (ms)\(^{-1}\) is comparable to flow rate in human navigation at a flow rate of \(4\) (ms)\(^{-1}\).</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2826543205 |
source | Publicly Available Content Database |
subjects | Algorithms Collision avoidance Collision dynamics Flow velocity Game theory Games Machine learning Multiagent systems Multiple robots Navigation Optimization Real time Robot dynamics Simulation models Trajectory optimization Trajectory planning |
title | Decentralized Social Navigation with Non-Cooperative Robots via Bi-Level Optimization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-22T16%3A47%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Decentralized%20Social%20Navigation%20with%20Non-Cooperative%20Robots%20via%20Bi-Level%20Optimization&rft.jtitle=arXiv.org&rft.au=Chandra,%20Rohan&rft.date=2023-06-15&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2826543205%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_28265432053%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2826543205&rft_id=info:pmid/&rfr_iscdi=true |