Generalised formulations for minimum distance trajectory in patrolling problems

DOI10.1049/IET-CTA.2019.0281MaRDI QIDQ6598761zbMATH OpenFDO

Authors Walaaeldin Ghadiry, Jalal Habibi, Amir G. Aghdam, Youmin Zhang

Publication date 5 September 2024

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

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

zbMATH Keywords

general formulationsgeneralised formulationsminimum distance trajectorymobile robotsmultidepot multiple travelling salesman problempatrolling problemstarting depotstotal travel distancetrajectory optimisationtravelling salesman problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Distance-based solution of patrolling problems with individual waiting times
• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Multi-robot area patrol under frequency constraints
• Patrolling by robots equipped with visibility
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling

Cites work

• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• Integer linear programming formulations of multiple salesman problems and its variations

Cited in

(1)

• Distance-based solution of patrolling problems with individual waiting times

This page was built for publication: Generalised formulations for minimum distance trajectory in patrolling problems

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