← Back to all news
arXiv AI 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

Reward-Guided RRT* for Budgeted Task and Motion Planning

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv Machine Learning
Aug 17

Expected Free Energy-based Informative Path Planning for Robotic Mars Exploration

arXiv:2608. 14466v1 Announce Type: cross Abstract: An autonomous robot efficiently exploring an unknown environment, such as looking for water sources on Mars, faces two simultaneous demands: building an accurate information map while quickly finding the regions of greatest value, and paying for every meter of travel and the cost of every measurement it takes.

By Ajith Anil Meera, Pablo Lanillos, Wouter Kouw
agentsrobotics
More like this →
arXiv AI
Sep 16

QDTraj: Exploration of Diverse Trajectory Primitives for Articulated Objects Robotic Manipulation

The paper introduces QDTraj, a method that uses Quality‑Diversity algorithms to automatically generate a diverse set of low‑level trajectory primitives for manipulating articulated objects. By leveraging sparse reward exploration, QDTraj produces at least five times more diverse trajectories for hinge and slider tasks compared to baseline methods, and demonstrates strong generalization across 30 articulations from the PartNetMobility dataset, averaging 704 trajectories per task. The resulting primitives are validated both in simulation and on real robots, with the code released publicly.

By Mathilde Kappel, Mahdi Khoramshahi, Louis Annabi, Faiz Ben Amar, St\'ephane Doncieux
agentsrobotics
More like this →