You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: _bibliography/papers.bib
+9-31Lines changed: 9 additions & 31 deletions
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,7 @@ @string{ijrr
9
9
@misc{yang2025pachs,
10
10
title = {Parallel Heuristic Search as Inference for Actor-Critic Reinforcement Learning Models},
11
11
author = {Hanlan Yang and Itamar Mishani and Luca Pivetti and Zachary Kingston and Maxim Likhachev},
12
-
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{} (\textit{P}arallel \textit{A}ctor-\textit{C}ritic \textit{H}euristic \textit{S}earch), 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.},
12
+
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.},
13
13
eprint = {2509.25402},
14
14
archiveprefix = {arXiv},
15
15
primaryclass = {cs.RO},
@@ -88,7 +88,6 @@ @article{wilson2025aorrtc
88
88
code = {https://robotic-esp.com/code/aorrtc/},
89
89
video = {https://www.youtube.com/watch?v=j1itxP3KuiM},
title = {Efficient Multi-Robot Motion Planning for Manifold-Constrained Manipulators by Randomized Scheduling and Informed Path Generation},
@@ -314,31 +316,6 @@ @misc{Goues2024
314
316
projects = {software},
315
317
note = {Invited Contributor}
316
318
}
317
-
@inproceedings{Quintero2024wksp,
318
-
title = {Stochastic Implicit Neural Signed Distance Functions for Safe Motion Planning under Sensing Uncertainty},
319
-
author = {Carlos Quintero-Peña and Wil Thomason and Zachary Kingston and Anastasios Kyrillidis and Lydia E. Kavraki},
320
-
booktitle = {IEEE ICRA 2024 Workshop---Back to the Future: Robot Learning Going Probabilistic},
321
-
year = 2024,
322
-
pdf = {https://openreview.net/pdf?id=YEcJR7PTl8},
323
-
projects = {implicit},
324
-
abbr = {WKSP}
325
-
}
326
-
@inproceedings{Ramsey2024wksp,
327
-
title = {Dynamic Motion Planning from Perception via Accelerated Point Cloud Collision Checking},
328
-
author = {Clayton W. Ramsey and Zachary Kingston* and Wil Thomason* and Lydia E. Kavraki},
329
-
booktitle = {IEEE ICRA 2024 Workshop---Agile Robotics: From Perception to Dynamic Action},
330
-
year = 2024,
331
-
projects = {software,realtime},
332
-
abbr = {WKSP}
333
-
}
334
-
@inproceedings{Meng2024wksp,
335
-
title = {Monitoring Constraints for Robotic Tutors in Nurse Education: A Motion Planning Perspective},
336
-
author = {Qingxi Meng* and Carlos Quintero-Peña* and Zachary Kingston and Nicole M. Fontenot and Shannan K. Hamlin and Vaibhav Unhelkar and Lydia E. Kavraki},
337
-
booktitle = {IEEE ICRA 2024 Workshop---Workshop on Nursing Robotics},
338
-
year = 2024,
339
-
projects = {implicit,hri},
340
-
abbr = {WKSP}
341
-
}
342
319
@inproceedings{shome2023privacy,
343
320
title = {Robots as AI Double Agents: Privacy in Motion Planning},
344
321
author = {Rahul Shome and Zachary Kingston and Lydia E. Kavraki},
@@ -518,7 +495,8 @@ @inbook{kingston2020book
518
495
publisher = {Springer Berlin Heidelberg},
519
496
address = {Berlin, Heidelberg},
520
497
projects = {constraints},
521
-
chapter = {Planning Under Manifold Constraints}
498
+
chapter = {Planning Under Manifold Constraints},
499
+
preview = {constraint.jpg}
522
500
}
523
501
@inproceedings{kingston2020leads,
524
502
title = {Informing Multi-Modal Planning with Synergistic Discrete Leads},
0 commit comments