· IISE Annual Conference & Expo 2025· 0 citations
TL;DR
This work proposes an alternative formulation for the Service Agent Transport Problem (SATP), a widely studied problem in autonomous transportation that incorporates acceleration techniques such as problem-specific valid inequalities, warm-start strategies, node reduction, and lower bounds from approximation algorithms.
Abstract
This work proposes an alternative formulation for the Service Agent Transport Problem (SATP), a widely studied problem in autonomous transportation. SATP involves service agents performing tasks within polygonal service areas and coordinating with autonomous transport agents for high-speed movement between locations. Actions, including servicing, moving, docking, and deploying, each have known execution times to minimize the mission makespan. Our formulation eliminates dependency on predefined phases used in previous work. It incorporates acceleration techniques such as problem-specific valid inequalities, warm-start strategies, node reduction, and lower bounds from approximation algorithms. Results demonstrate superior performance across lower bounds, upper bounds, and computational time, and we illustrate the approach with a case study on scheduling autonomous underwater surveillance vehicles.
When coordinating connected and automated vehicles at an unsignalized intersection, the crossing order and the vehicle trajectories must be decided jointly. For a fixed crossing order, the problem can be formulated conveniently in a bi-level form where each vehicle solves its own optimal control problem, whose optimal...
Saugat Shahi, Jonathan Frey, F. Fabiani et al.· 2 citations
We consider the coordination of autonomous vehicles at unsignalized intersections, where trajectory planning and crossing-order decisions are intrinsically coupled, thereby making their simultaneous optimization intractable in practice. To this end, we propose a heuristic based on a hierarchical structure consisting of...
Saugat Shahi, F. Fabiani, Mario Zanon· 2 citations
The coordination of autonomous vehicles at unsignalized intersections requires deciding both the trajectories of the vehicles and their crossing order, with the additional difficulty that the set of vehicles to be coordinated changes as traffic flows through the intersection. Since the resulting mixed-integer optimal c...
Saugat Shahi, F. Fabiani, Mario Zanon· 2 citations
An algorithm for optimizing transport and technological cycles of unmanned aerial vehicles using GERT network modeling and the branch-and-bound method is developed that can support decision-making in planning UAV operations in precision agriculture.
В. А. Подоплелова, Д. И. Ковалев, V. Podoplelova et al.· 0 citations
Driven by advances in artificial intelligence (AI), ship path planning (SPP) has emerged as a core technique for autonomous ships to guarantee navigation safety and enhance energy efficiency. Nevertheless, complex marine environments impose multiple constraints and competing optimization objectives, which greatly limit...
Feng-De Qu, Yi-Ting Gong, Jing-Jing Liu et al.· Journal of Marine Science an...· 0 citations
This work investigates the use of flow-based connectivity maintenance constraints in mixed-integer linear programming (MILP) trajectory planning and decision-making models for networked multi-agent systems (MAS). We integrate flow-based encodings for standard and k-hop connectivity into MILP multi-vehicle maneuvering m...
Angelo Caregnato-Neto, Paul-Louis Delacour, R. Van de Plas et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.