Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents

DOI10.1109/TCNS.2020.2983791MaRDI QIDQ4969507zbMATH OpenOpenAlexFDO

Authors Amritha Prasad, Han-Lim Choi, Shreyas Sundaram

Publication date 5 October 2020

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcns.2020.2983791

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Systems theory; control (93-XX)

Cited in

(3)

• Approximation algorithms for solving the heterogeneous Chinese postman problem
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
• Approximation algorithms for solving the heterogeneous rooted tree/path cover problems

This page was built for publication: Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents

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