Nir Lipovetzky
Nir Lipovetzky
Home
News
Projects
Publications
Students
Awards
Service
Teaching
Contact
Hector Geffner
Latest
Best-First Width Search in the IPC 2018: Complete, Simulated, and Polynomial Variants
A Polynomial Planning Algorithm that Beats LAMA and FF
Best-first width search: Exploration and exploitation in classical planning
Purely Declarative Action Representations are Overrated: Classical Planning with Simulators
Traps, invariants, and dead-ends
Classical Planning with Simulators: Results on the Atari Video Games
Width and inference based planners: Siw, bfs (f), and probe
Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners
Width and serialization of classical planning problems
Computing Infinite Plans for LTL Goals Using a Classical Planner
Searching with probes: The classical planner probe
Inference and decomposition in planning using causal consistent chains
Path-based heuristic (preliminary version)
C3: Planning with consistent causal chains
Structural Inference in Planning: Scaling up without Heuristic Estimators
Cite
×