James Kuffner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
James Kuffner has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Satoshi Kagami
AIST:JST
2 shared publications C.S. George Lee
1 shared publication- Daniel Althoff
Institute of Automatic Control Engineering (LSR), Technische Universität München, Munich, Germany
1 shared publication - Dinesh Manocha
University of Maryland, College Park, USA
1 shared publication - Dirk Wollherr
Chair of Automatic Control Engineering, Technical University of Munich, Munich, Germany
1 shared publication - Hirochika Inoue
University of Tokyo
1 shared publication
Latest Publications
- 3 April 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics & Automation Magazine
- Vol. 19 (1) , 108-118
Humanoid Robotics [TC Spotlight]
- 3 April 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics & Automation Magazine
- Vol. 19 (1) , 108-118
Humanoid Robotics [TC Spotlight]
- 19 November 2011
- Published by Springer Nature in Autonomous Robots
- Vol. 32 (3) , 285-302
Safety assessment of robot trajectories for navigation in uncertain and dynamic environments
- 19 November 2011
- Published by Springer Nature in Autonomous Robots
- Vol. 32 (3) , 285-302
Safety assessment of robot trajectories for navigation in uncertain and dynamic environments
- 1 January 2009
- Published by Springer Nature
- p. 599-614
Path Planning among Movable Obstacles: A Probabilistically Complete Approach
- 1 January 2009
- Published by Springer Nature
- p. 599-614
Path Planning among Movable Obstacles: A Probabilistically Complete Approach
- 1 November 2008
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 27 (11-12) , 1295-1307
Planning Among Movable Obstacles with Artificial Constraints
In this paper we present artificial constraints as a method for guiding heuristic search in the computationally challenging domain of motion planning among movable obstacles. The robot is permitted to manipulate unspecified obstacles in order to create space for a path. A plan is an ordered sequence of paths for robot motion and object manipulation. We show that under monotone assumptions, anticipating future manipulation paths results in constraints on both the choice of objects and their placements at earlier stages in the plan. We present an algorithm that uses this observation to incrementally reduce the search space and quickly find solutions to previously unsolved classes of movable obstacle problems. Our planner is developed for arbitrary robot geometry and kinematics. It is presented with an implementa tion for the domain of navigation among movable obstacles.
- 1 November 2008
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 27 (11-12) , 1295-1307
Planning Among Movable Obstacles with Artificial Constraints
In this paper we present artificial constraints as a method for guiding heuristic search in the computationally challenging domain of motion planning among movable obstacles. The robot is permitted to manipulate unspecified obstacles in order to create space for a path. A plan is an ordered sequence of paths for robot motion and object manipulation. We show that under monotone assumptions, anticipating future manipulation paths results in constraints on both the choice of objects and their placements at earlier stages in the plan. We present an algorithm that uses this observation to incrementally reduce the search space and quickly find solutions to previously unsolved classes of movable obstacle problems. Our planner is developed for arbitrary robot geometry and kinematics. It is presented with an implementa tion for the domain of navigation among movable obstacles.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164)
- No. 10504729,p. 1035-1041
Efficient Two-phase 3D Motion Planning for Small Fixed-wing UAVs
We present an efficient two-phase approach to motion planning for small fixed-wing unmanned aerial vehicles (UAVs) navigating in complex 3D air slalom environments. A coarse global motion planner first computes a kinematically feasible obstacle-free path in a discretized 3D workspace which roughly satisfies the kinematic constraints of the UAV. Given a coarse global path, a fine local motion planner is used to compute a more accurate trajectory for the UAV at a higher level of detail. The local planner is iterated as the vehicle traverses and refines the global path as needed up to its planning horizon. We also introduce a new planning heuristic for 3D motions of fixed-wing UAVs based on 2D Dubins curves, along with precomputed sets of motion primitives derived from the vehicle dynamics model in order to achieve high efficiency.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164)
- No. 10504729,p. 1035-1041
Efficient Two-phase 3D Motion Planning for Small Fixed-wing UAVs
We present an efficient two-phase approach to motion planning for small fixed-wing unmanned aerial vehicles (UAVs) navigating in complex 3D air slalom environments. A coarse global motion planner first computes a kinematically feasible obstacle-free path in a discretized 3D workspace which roughly satisfies the kinematic constraints of the UAV. Given a coarse global path, a fine local motion planner is used to compute a more accurate trajectory for the UAV at a higher level of detail. The local planner is iterated as the vehicle traverses and refines the global path as needed up to its planning horizon. We also introduce a new planning heuristic for 3D motions of fixed-wing UAVs based on 2D Dubins curves, along with precomputed sets of motion primitives derived from the vehicle dynamics model in order to achieve high efficiency.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164)
- No. 10504729,p. 1603-1609
Multipartite RRTs for Rapid Replanning in Dynamic Environments
The rapidly-exploring random tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically complete planning method which generalizes well to a variety of problem domains. We present the multipartite RRT (MP-RRT), an RRT variant which supports planning in unknown or dynamic environments. By purposefully biasing the sampling distribution and re-using branches from previous planning iterations, MP-RRT combines the strengths of existing adaptations of RRT for dynamic motion planning. Experimental results show MP-RRT to be very effective for planning in dynamic environments with unknown moving obstacles, replanning in high-dimensional configuration spaces, and replanning for systems with space time constraints.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164)
- No. 10504729,p. 1603-1609
Multipartite RRTs for Rapid Replanning in Dynamic Environments
The rapidly-exploring random tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically complete planning method which generalizes well to a variety of problem domains. We present the multipartite RRT (MP-RRT), an RRT variant which supports planning in unknown or dynamic environments. By purposefully biasing the sampling distribution and re-using branches from previous planning iterations, MP-RRT combines the strengths of existing adaptations of RRT for dynamic motion planning. Experimental results show MP-RRT to be very effective for planning in dynamic environments with unknown moving obstacles, replanning in high-dimensional configuration spaces, and replanning for systems with space time constraints.
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 560-566
Efficient Collision and Self-Collision Detection for Humanoids Based on Sphere Trees Hierarchies
We present an algorithm for computing compact sphere tree hierarchies over general 3D polygonal meshes for the purpose of efficient collision detection and minimum distance computation. The sphere tree construction method we use optimizes the location of the sphere centers and radii at each level of the hierarchy to compactly contain the underlying geometry. We enhance the hierarchy construction so that it can be applied to both self-collision and obstacle collision detection for articulated robots. Finally, we introduce distance range bounds that are effective for minimizing the overall number of required distance computations. The result is a faster algorithm that performs particularly well on collections of multiple mesh objects
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 560-566
Efficient Collision and Self-Collision Detection for Humanoids Based on Sphere Trees Hierarchies
We present an algorithm for computing compact sphere tree hierarchies over general 3D polygonal meshes for the purpose of efficient collision detection and minimum distance computation. The sphere tree construction method we use optimizes the location of the sphere centers and radii at each level of the hierarchy to compactly contain the underlying geometry. We enhance the hierarchy construction so that it can be applied to both self-collision and obstacle collision detection for articulated robots. Finally, we introduce distance range bounds that are effective for minimizing the overall number of required distance computations. The result is a faster algorithm that performs particularly well on collections of multiple mesh objects