Organizational Unit:
Humanoid Robotics Laboratory
Humanoid Robotics Laboratory
Permanent Link
Research Organization Registry ID
Description
Previous Names
Parent Organization
Parent Organization
Organizational Unit
Includes Organization(s)
ArchiveSpace Name Record
Publication Search Results
Now showing
1 - 5 of 5
-
ItemManipulation Planning with Soft Task Constraints(Georgia Institute of Technology, 2012-10) Kunz, Tobias ; Stilman, MikeWe present a randomized configuration space planner that enforces soft workspace task constraints. A soft task constraint allows an interval of feasible values while favoring a given exact value. Previous work only allows for enforcing an exact value or an interval without a specific preference. Soft task constraints are a useful concept in everyday life. For example when carrying a container of liquid we want to keep it as close to the upright position as possible but want to be able to tilt it slightly in order to avoid obstacles. This paper introduces the necessary algorithms for handling such constraints, including projection methods and useful representations of everyday constraints. Our algorithms are evaluated on a series of simulated benchmark problems and shown to yield significant improvement in constraint satisfaction.
-
ItemTime-Optimal Trajectory Generation for Path Following with Bounded Acceleration and Velocity(Georgia Institute of Technology, 2012-07) Kunz, Tobias ; Stilman, MikeThis paper presents a novel method to generate the time-optimal trajectory that exactly follows a given differentiable joint-space path within given bounds on joint accelerations and velocities. We also present a path preprocessing method to make nondifferentiable paths differentiable by adding circular blends. We introduce improvements to existing work that make the algorithm more robust in the presence of numerical inaccuracies. Furthermore we validate our methods on hundreds of randomly generated test cases on simulated and real 7-DOF robot arms. Finally, we provide open source software that implements our algorithms.
-
ItemDynamic Chess: Strategic Planning for Robot Motion(Georgia Institute of Technology, 2011-05) Kunz, Tobias ; Kingston, Peter ; Stilman, Mike ; Egerstedt, Magnus B.We introduce and experimentally validate a novel algorithmic model for physical human-robot interaction with hybrid dynamics. Our computational solutions are complementary to passive and compliant hardware. We focus on the case where human motion can be predicted. In these cases, the robot can select optimal motions in response to human actions and maximize safety. By representing the domain as a Markov Game, we enable the robot to not only react to the human but also to construct an infinite horizon optimal policy of actions and responses. Experimentally, we apply our model to simulated robot sword defense. Our approach enables a simulated 7-DOF robot arm to block known attacks in any sequence. We generate optimized blocks and apply game theoretic tools to choose the best action for the defender in the presence of an intelligent adversary.
-
ItemTime-Optimal Path Following with Bounded Joint Accelerations and Velocities(Georgia Institute of Technology, 2011) Kunz, Tobias ; Stilman, MikeThis paper presents a method to generate the time-optimal trajectroy that exactly follows a given differentiable joint-space path within given bounds on joint accelerations and velocities. We also present a path preprocessing method to make nondifferentiable paths differentiable by adding circular blends.
-
ItemTurning Paths Into Trajectories Using Parabolic Blends(Georgia Institute of Technology, 2011) Kunz, Tobias ; Stilman, MikeWe present an approach for converting a path of multiple continuous linear segments into a trajectory that satisfies velocity and acceleration constraints and closely follows the given path without coming to a complete stop at every waypoint. Our method applies parabolic blends around waypoints to improve speed. In contrast to established methods that smooth trajectories with parabolic blends, our method does not require the timing of waypoints or durations of blend phases. This makes our approach particularly useful for robots that must follow kinematic paths that are not explicitly parametrized by time. Our method chooses timing automatically to achieve high performance while satisfying the velocity and acceleration constraints of a given robot.