Distributed multi-vehicle task assignment in a time-invariant drift field with obstacles

DOI10.1049/IET-CTA.2018.6125MaRDI QIDQ7025334zbMATH OpenFDO

Authors Xiaoshan Bai, Weisheng Yan, Ming Cao, Dong Xue

Publication date 19 February 2025

Published in IET Control Theory \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/IET-CTA.2018.6125

zbMATH Keywords

computational complexitydispersed vehiclesdistributed algorithmdistributed algorithmsminimisationmobile robotsmultiple target locationsmultivehicle task assignmentnumerical simulationpath planning algorithmremotely operated vehiclestarget assignmenttask assignment problemtime-invariant drift fieldtotal travel timetravel cost matrix

Mathematics Subject Classification ID

Distributed algorithms (68W15) Automated systems (robots, etc.) in control theory (93C85)

Cites work

• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Algorithms and Data Structures
• Gossip algorithms for heterogeneous multi-vehicle routing problems
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Monotonic Target Assignment for Robotic Networks
• Vehicle Routing

Cited in

(1)

• Coordinated collision avoidance for multi-vehicle systems based on collision time

This page was built for publication: Distributed multi-vehicle task assignment in a time-invariant drift field with obstacles

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