Scalable Co-optimization of Collective Robotic Mobility and the Artificial Environment

Información del proyecto

gAIa

Identificador del acuerdo de subvención: 949940

DOI

10.3030/949940

Fecha de la firma de la CE 7 Octubre 2020

Fecha de inicio 1 Enero 2021

Fecha de finalización 30 Septiembre 2026

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 495 338,00

Aportación de la UE

€ 1 495 338,00

Coordinado por

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE
United Kingdom

Periodic Reporting for period 3 - gAIa (Scalable Co-optimization of Collective Robotic Mobility and the Artificial Environment)

Período documentado: 2024-01-01 hasta 2025-06-30

Resumen del contexto y de los objetivos generales del proyecto

The premise of this project is that the environment is as much a variable as the robot itself. I want to expose the coupling between environmental structure and collective robotic mobility. In pursuit of this goal, I propose a co-optimization scheme that finds the best robot-environment pairs in an automated, scalable manner. The work in this project will (i) optimize control policies that define the behavior of collective mobile robot systems, and (ii) find layouts and structures of environments that are more conducive to efficient coordination and cooperation. The developed techniques will allow us to perform first-of-a-kind analyses that would reveal novel spatial topologies and morphologies, and the collective robot policies optimized around them. Ultimately, this project will spearhead new ways of thinking about transport planning and urban design, in the wake of a new generation of mobile vehicles that are connected and coordinated.

Trabajo realizado desde el comienzo del proyecto hasta el final del período abarcado por el informe y los principales resultados hasta la fecha

We have developed techniques that facilitate the learning of complex cooperative behaviors for multi-robot and multi-agent systems. We have also pioneered the first usages of Graph Neural Network-based policies in real-world robot deployments.

We have formalized the environment optimization problem for multi-agent navigation. Our first paper provides the conditions and proofs under which we can guarantee completeness of agent pathfinding. We show how environment optimization indeed provides significant benefits to the team, under a small cost. A follow-up journal paper, extends this theory to prioritized and constrained robots. The results are again backed up by theory that details the conditions under which priorities and path completeness will be met.

We have provided a formal problem statement for the co-optimization problem, and developed a hybrid learning-optimization approach to solving it. We demonstrate results on agent teams with limited communication, and show the value of joint policy-environment optimization. In our results, we show that counterintuitively, adding obstacles and clutter can guide autonomous agents in pursuit of more efficient and safer paths.

Avances que van más allá del estado de la técnica e impacto potencial esperado (incluida la repercusión socioeconómica y las implicaciones sociales más amplias del proyecto hasta la fecha)

(1) Our work has pioneering the use of differentiable communication through GNNs, as applied to robot systems. This has lead to a break-through for deployment of robot networks, as we can now much more effectively and efficiently synthesize coordinated behaviors. This will have implications for industries that use autonomous robots at scale (eg, warehouses, traffic, and monitoring).

(2) The topic of environment optimization is classically under-studied. Our initial set of publications has elucidated the importance and value of considering the environment as a decision variable, and has brought this topic to the forefront. In particular, we have provided strong theoretical guarantees on agent performance (under optimized environments), which will encourage uptake of the idea in the community at large across application sectors.