130 citations · 339 across the 23 of their papers we have counts for
4 papers · 1 filter
Solving Rearrangement Puzzles using Path Defragmentation in Factored State Spaces
Servet B. Bayraktar, Andreas Orthey, Zachary Kingston +2
Rearrangement puzzles are variations of rearrangement problems in which the elements of a problem are potentially logically linked together. To efficiently solve such puzzles, we d…
Rearrangement-Based Manipulation via Kinodynamic Planning and Dynamic Planning Horizons
Kejia Ren, Lydia E. Kavraki, Kaiyu Hang
Robot manipulation in cluttered environments often requires complex and sequential rearrangement of multiple objects in order to achieve the desired reconfiguration of the target o…
Synthesis from Satisficing and Temporal Goals
Suguman Bansal, Lydia Kavraki, Moshe Y. Vardi +1
Reactive synthesis from high-level specifications that combine hard constraints expressed in Linear Temporal Logic LTL with soft constraints expressed by discounted-sum (DS) reward…
Learning to Retrieve Relevant Experiences for Motion Planning
Constantinos Chamzas, Aedan Cullen, Anshumali Shrivastava +1
Recent work has demonstrated that motion planners' performance can be significantly improved by retrieving past experiences from a database. Typically, the experience database is q…