Learning Multi-Agent Navigation from Human Crowd Data

The task of safely steering agents amidst static and dynamic obstacles has many applications in robotics, graphics, and traffic engineering. While decentralized solutions are essential for scalability and robustness, achieving globally efficient motions for the entire system of agents is equally imp...

Full description

Bibliographic Details
Main Author: Joshi, Foram
Format: Text
Language:unknown
Published: Clemson University Libraries 2021
Subjects:
Online Access:https://tigerprints.clemson.edu/all_theses/3555
https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=4562&context=all_theses
id ftclemsonuniv:oai:tigerprints.clemson.edu:all_theses-4562
record_format openpolar
spelling ftclemsonuniv:oai:tigerprints.clemson.edu:all_theses-4562 2023-05-15T17:53:40+02:00 Learning Multi-Agent Navigation from Human Crowd Data Joshi, Foram 2021-05-01T07:00:00Z application/pdf https://tigerprints.clemson.edu/all_theses/3555 https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=4562&context=all_theses unknown Clemson University Libraries https://tigerprints.clemson.edu/all_theses/3555 https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=4562&context=all_theses All Theses text 2021 ftclemsonuniv 2022-07-17T13:48:23Z The task of safely steering agents amidst static and dynamic obstacles has many applications in robotics, graphics, and traffic engineering. While decentralized solutions are essential for scalability and robustness, achieving globally efficient motions for the entire system of agents is equally important. In a traditional decentralized setting, each agent relies on an underlying local planning algorithm that takes as input a preferred velocity and the current state of the agent's neighborhood and then computes a new velocity for the next time-step that is collision-free and as close as possible to the preferred one. Typically, each agent promotes a goal-oriented preferred velocity, which can result in myopic behaviors as actions that are locally optimal for one agent is not necessarily optimal for the global system of agents. In this thesis, we explore a human-inspired approach for efficient multi-agent navigation that allows each agent to intelligently adapt its preferred velocity based on feedback from the environment. Using supervised learning, we investigate different egocentric representations of the local conditions that the agents face and train various deep neural network architectures on extensive collections of human trajectory datasets to learn corresponding life-like velocities. During simulation, we use the learned velocities as high-level, preferred velocities signals passed as input to the underlying local planning algorithm of the agents. We evaluate our proposed framework using two state-of-the-art local methods, the ORCA method, and the PowerLaw method. Qualitative and quantitative results on a range of scenarios show that adapting the preferred velocity results in more time- and energy-efficient navigation policies, allowing agents to reach their destinations faster as compared to agents simulated with vanilla ORCA and PowerLaw. Text Orca Clemson University: TigerPrints
institution Open Polar
collection Clemson University: TigerPrints
op_collection_id ftclemsonuniv
language unknown
description The task of safely steering agents amidst static and dynamic obstacles has many applications in robotics, graphics, and traffic engineering. While decentralized solutions are essential for scalability and robustness, achieving globally efficient motions for the entire system of agents is equally important. In a traditional decentralized setting, each agent relies on an underlying local planning algorithm that takes as input a preferred velocity and the current state of the agent's neighborhood and then computes a new velocity for the next time-step that is collision-free and as close as possible to the preferred one. Typically, each agent promotes a goal-oriented preferred velocity, which can result in myopic behaviors as actions that are locally optimal for one agent is not necessarily optimal for the global system of agents. In this thesis, we explore a human-inspired approach for efficient multi-agent navigation that allows each agent to intelligently adapt its preferred velocity based on feedback from the environment. Using supervised learning, we investigate different egocentric representations of the local conditions that the agents face and train various deep neural network architectures on extensive collections of human trajectory datasets to learn corresponding life-like velocities. During simulation, we use the learned velocities as high-level, preferred velocities signals passed as input to the underlying local planning algorithm of the agents. We evaluate our proposed framework using two state-of-the-art local methods, the ORCA method, and the PowerLaw method. Qualitative and quantitative results on a range of scenarios show that adapting the preferred velocity results in more time- and energy-efficient navigation policies, allowing agents to reach their destinations faster as compared to agents simulated with vanilla ORCA and PowerLaw.
format Text
author Joshi, Foram
spellingShingle Joshi, Foram
Learning Multi-Agent Navigation from Human Crowd Data
author_facet Joshi, Foram
author_sort Joshi, Foram
title Learning Multi-Agent Navigation from Human Crowd Data
title_short Learning Multi-Agent Navigation from Human Crowd Data
title_full Learning Multi-Agent Navigation from Human Crowd Data
title_fullStr Learning Multi-Agent Navigation from Human Crowd Data
title_full_unstemmed Learning Multi-Agent Navigation from Human Crowd Data
title_sort learning multi-agent navigation from human crowd data
publisher Clemson University Libraries
publishDate 2021
url https://tigerprints.clemson.edu/all_theses/3555
https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=4562&context=all_theses
genre Orca
genre_facet Orca
op_source All Theses
op_relation https://tigerprints.clemson.edu/all_theses/3555
https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=4562&context=all_theses
_version_ 1766161363687702528