arXiv AI
Oct 27

Reward-Guided RRT* for Budgeted Task and Motion Planning

Reward‑Guided RRT* is a sampling‑based framework that builds budget‑feasible robotic missions by iteratively selecting rewarding locations and planning motions directly in continuous state space, without a pre‑computed task‑transition graph. The method uses reward‑guided RRT* searches and a return‑feasibility check to ensure each task can be visited within the travel budget. Experiments on increasingly complex obstacle environments and task counts show solutions comparable to VNS‑PRM* while sampling far fewer states, and the framework is extended to Dubins steering and validated on a scaled car‑like robot in CoppeliaSim.

By Vin\'icius Ara\'ujo de Oliveira, Gabriel Ferreira Mendes Louren\c{c}o, Paulo L. J. Drews-Jr, Armando Alves Neto, Douglas G. Macharet
arXiv AI
Jul 1

CoReLIN: Constraint-based Reasoning for Zero-shot Lifelong Interactive Navigation

arXiv:2602. 20055v2 Announce Type: replace-cross Abstract: Robot navigation typically assumes an obstacle-free path exists between start and goal.

By Apoorva Vashisth (Purdue University), Manav Kulshrestha (Purdue University), Pranav Bakshi (IIT Kharagpur), Damon Conover (DEVCOM Army Research Lab), Guillaume Sartoretti (National University of Singapore), Aniket Bera (Purdue University)