ROJul 29, 2018

A Distributed ADMM Approach to Non-Myopic Path Planning for Multi-Target Tracking

arXiv:1807.11068v619 citations
Originality Incremental advance
AI Analysis

This work addresses path planning for mobile sensors in multi-target tracking, offering an incremental improvement over heuristic methods by automating consensus decisions.

The paper tackles the computational complexity and decision-making challenges in non-myopic path planning for multi-target tracking by reformulating it as a distributed optimization problem using ADMM and local trajectory optimization, validated through simulations.

This paper investigates non-myopic path planning of mobile sensors for multi-target tracking. Such problem has posed a high computational complexity issue and/or the necessity of high-level decision making. Existing works tackle these issues by heuristically assigning targets to each sensing agent and solving the split problem for each agent. However, such heuristic methods reduce the target estimation performance in the absence of considering the changes of target state estimation along time. In this work, we detour the task-assignment problem by reformulating the general non-myopic planning problem to a distributed optimization problem with respect to targets. By combining alternating direction method of multipliers (ADMM) and local trajectory optimization method, we solve the problem and induce consensus (i.e., high-level decisions) automatically among the targets. In addition, we propose a modified receding-horizon control (RHC) scheme and edge-cutting method for efficient real-time operation. The proposed algorithm is validated through simulations in various scenarios.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes