# VBMO: Voting-Based Multi-Objective Path Planning

arXiv: https://arxiv.org/abs/2308.11755 · HTML: https://mlsanity.com/paper/2308.11755/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 44 references that are in the map.
- First posted on arXiv 22 Aug 2023.

## Builds on (most cited first, 2 of 2)

- [Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier](https://mlsanity.com/paper/2006.10302/) (2020)
- [Subdimensional Expansion for Multi-objective Multi-agent Path Finding](https://mlsanity.com/paper/2102.01353/) (2021)

## Abstract (arXiv)

This paper presents VBMO, the Voting-Based Multi-Objective path planning algorithm, that generates optimal single-objective plans, evaluates each of them with respect to the other objectives, and selects one with a voting mechanism. VBMO does not use hand-tuned weights, consider the multiple objectives at every step of search, or use an evolutionary algorithm. Instead, it considers how a plan that is optimal in one objective may perform well with respect to others. VBMO incorporates three voting mechanisms: range, Borda, and combined approval. Extensive evaluation in diverse and complex environments demonstrates the algorithm's ability to efficiently produce plans that satisfy multiple objectives.