Communication-Critical Planning via Multi-Agent Trajectory Exchange

Nathaniel Moore Glaser, Zsolt Kira
3/10/2023
cs.ROcs.CV

No confident code implementation found for this paper.

Abstract

This paper addresses the task of joint multi-agent perception and planning, especially as it relates to the real-world challenge of collision-free navigation for connected self-driving vehicles. For this task, several communication-enabled vehicles must navigate through a busy intersection while avoiding collisions with each other and with obstacles. To this end, this paper proposes a learnable costmap-based planning mechanism, given raw perceptual data, that is (1) distributed, (2) uncertainty-aware, and (3) bandwidth-efficient. Our method produces a costmap and uncertainty-aware entropy map to sort and fuse candidate trajectories as evaluated across multiple-agents. The proposed method demonstrates several favorable performance trends on a suite of open-source overhead datasets as well as within a novel communication-critical simulator. It produces accurate semantic occupancy forecasts as an intermediate perception output, attaining a 72.5% average pixel-wise classification accuracy. By selecting the top trajectory, the multi-agent method scales well with the number of agents, reducing the hard collision rate by up to 57% with eight agents compared to the single-agent version.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{glaser2023communicationcritical,
  title  = {Communication-Critical Planning via Multi-Agent Trajectory Exchange},
  author = {Nathaniel Moore Glaser and Zsolt Kira},
  year   = {2023},
  eprint = {2303.06080},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.06080v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.06080.svg)](https://codeofpaper.com/paper/2303.06080)

Discussion