Parallel Heuristic Search as Inference for Actor-Critic Reinforcement Learning Models (Extended Abstract)

Authors

  • Itamar Mishani Carnegie Mellon University, Robotics Institute
  • Hanlan Yang Purdue University Carnegie Mellon University, Robotics Institute
  • Luca Pivetti Carnegie Mellon University, Robotics Institute University of Milano-Bicocca
  • Zachary Kingston Purdue University
  • Maxim Likhachev Carnegie Mellon University, Robotics Institute

DOI:

https://doi.org/10.1609/socs.v19i1.43111

Abstract

Actor-critic models are a class of model-free deep reinforcement learning (RL) algorithms that have demonstrated effectiveness across various robot learning tasks. While considerable research has focused on improving training stability and data sampling efficiency, most deployment strategies have remained relatively simplistic, typically relying on direct actor policy rollouts. In contrast, we propose PACHS (Parallel Actor-Critic Heuristic Search), an efficient parallel best-first search algorithm for inference that leverages both components of the actor-critic architecture: the actor network generates actions, while the critic network provides cost-to-go estimates to guide the search. Two levels of parallelism are employed within the search---actions and cost-to-go estimates are generated in batches by the actor and critic networks respectively, and graph expansion is distributed across multiple threads. We demonstrate the effectiveness of our approach in robotic manipulation tasks, including collision-free motion planning and contact-rich interactions such as non-prehensile pushing. Visit https://p-achs.github.io for demonstrations and examples.

Downloads

Published

2026-08-14

How to Cite

Mishani, I., Yang, H., Pivetti, L., Kingston, Z., & Likhachev, M. (2026). Parallel Heuristic Search as Inference for Actor-Critic Reinforcement Learning Models (Extended Abstract). Proceedings of the International Symposium on Combinatorial Search, 19(1), 310–311. https://doi.org/10.1609/socs.v19i1.43111