Optimal partitioning for multi-vehicle systems using quadratic performance criteria

DOI10.1016/J.AUTOMATICA.2013.08.005zbMATH Open1315.93003OpenAlexW2022649788MaRDI QIDQ2350801FDOQ2350801

Authors: Efstathios Bakolas 

Publication date: 25 June 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.08.005

Recommendations

• Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
• Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field
• Optimal partitioning for spatiotemporal coverage in a drift field
• Partitioning algorithms for multi-agent systems based on finite-time proximity metrics
• The Zermelo-Voronoi diagram: a dynamic partition problem

zbMATH Keywords

computational methodsVoronoi diagramsautonomous agentsspatial partitioningmulti-vehicle systems

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Decentralized systems (93A14)

Cited In (6)

• Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints
• Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
• The Zermelo-Voronoi diagram: a dynamic partition problem
• Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field
• Partitioning algorithms for multi-agent systems based on finite-time proximity metrics
• Optimal partitioning for spatiotemporal coverage in a drift field

This page was built for publication: Optimal partitioning for multi-vehicle systems using quadratic performance criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350801)