activity
20152022
most citeddRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning

93 citations · 121 across the 6 of their papers we have counts for

collaborators

16 papers

cs.MA20224 cited

Leveraging Experience in Lifelong Multi-Agent Pathfinding

Nitzan Madar, Kiril Solovey, Oren Salzman

In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs a stream of tasks consisting of multiple locations to be visited by the agents on a shared graph while avoid…

cs.RO2020

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Kiril Solovey, Saptarshi Bandyopadhyay, Federico Rossi +2

Multi-robot systems are uniquely well-suited to performing complex tasks such as patrolling and tracking, information gathering, and pick-up and delivery problems, offering signifi…

cs.RO2020

Complexity of Planning

Kiril Solovey

This is a chapter in the Encyclopedia of Robotics. It is devoted to the study of complexity of complete (or exact) algorithms for robot motion planning. The term ``complete'' indic…

cs.MA2020

On Local Computation for Optimization in Multi-Agent Systems

Robin Brown, Federico Rossi, Kiril Solovey +2

A number of prototypical optimization problems in multi-agent systems (e.g., task allocation and network load-sharing) exhibit a highly local structure: that is, each agent's decis…

cs.DS2019

Sample Complexity of Probabilistic Roadmaps via -nets

Matthew Tsao, Kiril Solovey, Marco Pavone

We study fundamental theoretical aspects of probabilistic roadmaps (PRM) in the finite time (non-asymptotic) regime. In particular, we investigate how completeness and optimality g…

cs.RO2019

Efficient Large-Scale Multi-Drone Delivery Using Transit Networks

Shushman Choudhury, Kiril Solovey, Mykel J. Kochenderfer +1

We consider the problem of controlling a large fleet of drones to deliver packages simultaneously across broad urban areas. To conserve energy, drones hop between public transit ve…