{"type":"ScholarlyArticle","title":"Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths","authors":[{"name":"Stefan Funke","slug":"stefan-funke","given":"Stefan","family":"Funke","affiliation":""},{"name":"Daniel Koch","slug":"daniel-koch","given":"Daniel","family":"Koch","affiliation":""},{"name":"Claudius Proissl","slug":"claudius-proissl","given":"Claudius","family":"Proissl","affiliation":""},{"name":"Christian Staib","slug":"christian-staib","given":"Christian","family":"Staib","affiliation":""},{"name":"Felix Weitbrecht","slug":"felix-weitbrecht","given":"Felix","family":"Weitbrecht","affiliation":""}],"abstract":"We consider the problem of quickly providing strong lower bounds for the planar Euclidean shortest path (ESP) problem. Such lower bounds are crucial for guiding the search in A* type approaches or for proving quality guarantees for algorithms that compute approximate solutions.\r\nOur contributions are two-fold: we show how to simplify ESP instances such that computing and storing a visibility graph becomes feasible while distances within the simplified instance are guaranteed to constitute lower bounds for the original problem instance. Furthermore we show how to precompute a space efficient data structure that allows to perform distance queries on visibility graphs within few microseconds with negligible space overhead.","doi":"10.24963/ijcai.2025/946","url":"https://ijcai.org/proceedings/2025/946","pdf":"https://ijcai.org/proceedings/2025/0946.pdf","markdown":"https://ijcai.org/proceedings/2025/946.md","bibtex":"https://ijcai.org/proceedings/2025/bibtex/946","volume":{"slug":"2025","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2025","url":"https://ijcai.org/proceedings/2025/","year":2025,"location":"Montreal, Canada","dates":"16-22 August 2025","editors":"James Kwok","isbn":"978-1-956792-06-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2025"},"section":"Planning and Scheduling","track":"Main Track","number":946,"pages":{"first":8510,"last":8517},"keywords":["Planning and Scheduling: PS: Routing","Search: S: Combinatorial search and optimisation","Search: S: Applications"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}