{"total":14,"rows":[{"id":"2307.06135","title":"SayPlan: Grounding Large Language Models using 3D Scene Graphs for Scalable Robot Task Planning","created":"2023-07-12","cited_by_count":294,"area":null},{"id":"2207.05006","title":"TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs","created":"2022-07-11","cited_by_count":59,"area":null},{"id":"2210.12631","title":"LEAGUE: Guided Skill Learning and Abstraction for Long-Horizon Manipulation","created":"2022-10-23","cited_by_count":34,"area":null},{"id":"2404.02817","title":"A Survey of Optimization-based Task and Motion Planning: From Classical To Learning Approaches","created":"2024-04-03","cited_by_count":20,"area":null},{"id":"2210.12250","title":"STAP: Sequencing Task-Agnostic Policies","created":"2022-10-21","cited_by_count":18,"area":null},{"id":"2112.07066","title":"Continual Learning In Environments With Polynomial Mixing Times","created":"2021-12-13","cited_by_count":14,"area":null},{"id":"2109.09876","title":"Context-Specific Representation Abstraction for Deep Option Learning","created":"2021-09-20","cited_by_count":8,"area":null},{"id":"2203.04605","title":"Representation, learning, and planning algorithms for geometric task and motion planning","created":"2022-03-09","cited_by_count":8,"area":null},{"id":"2306.05171","title":"Robot Task Planning Based on Large Language Model Representing Knowledge with Directed Graph Structures","created":"2023-06-08","cited_by_count":7,"area":null},{"id":"2406.00614","title":"Efficient Monte Carlo Tree Search via On-the-Fly State-Conditioned Action Abstraction","created":"2024-06-02","cited_by_count":6,"area":null},{"id":"2506.07062","title":"Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search","created":"2025-06-08","cited_by_count":4,"area":null},{"id":"2510.23214","title":"AUPO -- Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm","created":"2025-10-27","cited_by_count":3,"area":null},{"id":"2510.24297","title":"Investigating Intra-Abstraction Policies For Non-exact Abstraction Algorithms","created":"2025-10-28","cited_by_count":2,"area":null},{"id":"2510.26346","title":"Discovering State Equivalences in UCT Search Trees By Action Pruning","created":"2025-10-30","cited_by_count":0,"area":null}],"next_cursor":null}