2000 character limit reached
Tightest Admissible Shortest Path (2308.08453v2)
Published 15 Aug 2023 in cs.DS, cs.AI, and cs.DM
Abstract: The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its common relation to weight uncertainty. This implies that taking these factors into consideration can potentially lead to a performance boost in relevant applications. Recently, a generalized framework for weighted directed graphs was suggested, where edge-weight can be computed (estimated) multiple times, at increasing accuracy and run-time expense. We build on this framework to introduce the problem of finding the tightest admissible shortest path (TASP); a path with the tightest suboptimality bound on the optimal cost. This is a generalization of the shortest path problem to bounded uncertainty, where edge-weight uncertainty can be traded for computational cost. We present a complete algorithm for solving TASP, with guarantees on solution quality. Empirical evaluation supports the effectiveness of this approach.
- A procedure for power consumption estimation of multi-rotor unmanned aerial vehicle. In Journal of Physics: Conference Series, volume 1509, 012015. IOP Publishing.
- A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 26, 459–467.
- Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische mathematik, 1(1): 269–271.
- Semantic attachments for domain-independent planning systems. Towards Service Robots for Everyday Environments: Recent Advances in Designing Service Robots for Complex Tasks in Everyday Environments, 99–115.
- Felner, A. 2011. Position paper: Dijkstra’s algorithm versus uniform cost search or a case against Dijkstra’s algorithm. In Proceedings of the International Symposium on Combinatorial Search, volume 2, 47–51.
- Purely Declarative Action Descriptions are Overrated: Classical Planning with Simulators. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, 4294–4301.
- Frank, H. 1969. Shortest paths in probabilistic graphs. Operations Research, 17(4): 583–599.
- Real-time wind predictions for safe drone flights in Toronto. Results in Engineering, 15: 100534.
- Planning modulo theories: Extending the planning paradigm. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 22, 65–73.
- Helmert, M. 2006. The Fast Downward Planning System. Journal of Artificial Intelligence Research, 26: 191–246.
- An external memory data structure for shortest path queries. Discrete Applied Mathematics, 126(1): 55–82.
- Jabbar, S. 2008. External Memory Algorithms for State Space Exploration in Model Checking and Action Planning. PhD Dissertation, Technical University of Dortmund, Dortmund, Germany.
- Drone scheduling model for delivering small parcels to remote islands considering wind direction and speed. Computers & Industrial Engineering, 163: 107784.
- Rational deployment of multiple heuristics in optimal state-space search. Artificial Intelligence, 256: 181–210.
- Korf, R. 2008a. Minimizing disk I/O in two-bit breadth-first search. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 23, 317–324.
- Korf, R. 2016. Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16, 610–616.
- Korf, R. E. 2008b. Linear-time disk-based implicit graph search. Journal of the ACM (JACM), 55(6): 1–40.
- Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles. In Proceedings of the International Conference on Automated Planning and Scheduling, 745–753.
- Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 28, 476–484.
- Heuristic search on graphs with existence priors for expensive-to-evaluate edges. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 27, 522–530.
- Fuzzy shortest path problem. Computers & Industrial Engineering, 27(1-4): 465–468.
- PTV-Group. 2023. Truck ETA calculation with the PTV Drive&Arrive API. https://www.myptv.com/en/logistics-software/ETA-software-ptv-driveandarrive. Accessed: 2023-8-5.
- Potential-based bounded-cost search and Anytime Non-Parametric A**{}^{\mbox{*}}start_FLOATSUPERSCRIPT * end_FLOATSUPERSCRIPT. Artif. Intell., 214: 1–25.
- External Memory Bidirectional Search. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16, 676–682.
- Vitter, J. S. 2001. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2): 209–271.
- A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. In Proceedings of the European Conference on Artificial Intelligence, volume 372, 2607–2614.
- Position Paper: Online Modeling for Offline Planning. In Proceedings of the 1st ICAPS Workshop on Reliable Data-Driven Planning and Scheduling.
- PlanDEM. https://github.com/eyal-weiss/plandem-public. Accessed: 2023-07-26.
- Planning with Multiple Action-Cost Estimates. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 33, 427–437.