首页 /研究 /Obscuring Objectives with Pareto-Optimal Privacy-Aware Trajectories in Multi-Robot Coverage
SWARM

Obscuring Objectives with Pareto-Optimal Privacy-Aware Trajectories in Multi-Robot Coverage

Brennan Brodt, Alyssa Pierson

发表年份
2023
引用次数
3

摘要

This paper proposes an algorithm for generating Pareto-optimal privacy-aware trajectories for multi-robot coverage. Our approach utilizes a genetic algorithm to generate a set of modified trajectories for a team of robots that wishes to obscure its goal from an observer. A novel velocity-constrained crossover algorithm ensures all child trajectories are feasible for a holonomic vehicle. The Pareto front of generated trajectories allows a team to select an allowable trade-off between privacy and coverage cost given within their task. Simulation results demonstrate the performance of our algorithm in Voronoi-based coverage control. We show our approach successfully obscures the objective from our proposed observer.

关键词

Computer scienceRobotCrossoverObserver (physics)Genetic algorithmPareto principleSet (abstract data type)Pareto optimalMulti-objective optimizationTask (project management)

相关论文

查看 SWARM 分类全部论文