22 citations · 25 across the 7 of their papers we have counts for
8 papers
Approximate Multi-Objective Search Under Rulebooks
Omar Muhammetkulyyev, Oren Salzman, Tichakorn Wongpiromsarn
Robotic planning often involves multiple objectives with complex priority relationships, such as safety, efficiency, and regulatory compliance. Rulebooks formalize these relationsh…
Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search
Maya Wolff, Ariel Felner, Oren Salzman
Multi-objective shortest-path (MOSP) algorithms traditionally rely on single-valued heuristics (SVHs), which associate each state with a single admissible cost vector. While SVHs p…
Bridging the Evaluation Gap: Standardized Benchmarks for Multi-Objective Search
Hadar Peer, Carlos Hernandez, Sven Koenig +2
Empirical evaluation in multi-objective search (MOS) has historically suffered from fragmentation, relying on heterogeneous problem instances with incompatible objective definition…
Multi-Objective Search: Algorithms, Applications, and Emerging Directions
Oren Salzman, Carlos Hernández Ulloa, Ariel Felner +1
Multi-objective search (MOS) has emerged as a unifying framework for planning and decision-making problems where multiple, often conflicting, criteria must be balanced. While the p…
A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
Yaron Halle, Ariel Felner, Sven Koenig +1
The bi-objective shortest-path (BOSP) problem seeks to find paths between start and target vertices of a graph while optimizing two conflicting objective functions. We consider the…
Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots
Priyanka Rao, Oren Salzman, Jessica Burgner-Kahrs
Tendon-driven continuum robots (TDCRs), with their flexible backbones, offer the advantage of being used for navigating complex, cluttered environments. However, to do so, they typ…
T* -- Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems
Doron Pinsky, Petr Váňa, Jan Faigl +1
We consider the problem of finding collision-free paths for curvature-constrained systems in the presence of obstacles while minimizing execution time. Specifically, we focus on th…
Minimizing Task Space Frechet Error via Efficient Incremental Graph Search
Rachel Holladay, Oren Salzman, Siddhartha Srinivasa
We present an anytime algorithm that generates a collision-free configuration-space path that closely follows a desired path in task space, according to the discrete Frechet distan…