Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Robust multi-agent collision avoidance through scheduling

Robust multi-agent collision avoidance through scheduling

Thumbnail Image
Download
Name

Del Vecchio_Robust multi-agent.pdf

Size

1.11 MB

Format

Adobe PDF

Checksum (MD5)

39103833b6e0b33503eed5eb2800e79c

Author(s)
Bruni, Leonardo
•
Colombo, Alessandro
•
Del Vecchio, Domitilla
Date Issued
December 2013
Journal
Proceedings of the 52nd IEEE Conference on Decision and Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Bruni, Leonardo, Alessandro Colombo, and Domitilla Del Vecchio. “Robust Multi-Agent Collision Avoidance through Scheduling.” 52nd IEEE Conference on Decision and Control (December 2013).
Version
Author's final manuscript
Abstract
We propose a class of computationally efficient algorithms for conflict resolution in the presence of modeling and measurement uncertainties. Specifically, we address a scenario where a number of agents, whose dynamics are possibly nonlinear, must cross an intersection avoiding collisions. We obtain an exact solution and an approximate one with quantified error bound whose complexity scales polynomially with the number of agents.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/97412
DOI of Published Version
https://doi.org/10.1109/CDC.2013.6760492
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.