3 papers
cs.AI2026
Optimal Planning in a Dynamic World
Devin Wild Thomas, Solomon Eyal Shimony, Wheeler Ruml +3
Background: We address the problem of planning when the set of feasible states or actions changes over time. For example, in the problem of path planning among moving obstacles (so…
cs.AI2026
Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1
Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce th…
cs.AI2024
Planning and Acting While the Clock Ticks
Andrew Coles, Erez Karpas, Andrey Lavrinenko +3
Standard temporal planning assumes that planning takes place offline and then execution starts at time 0. Recently, situated temporal planning was introduced, where planning starts…