Michael Barbehenn

According to our database, Michael Barbehenn authored at least 7 papers between 1991 and 1998.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1998

A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices.

Michael Barbehenn

IEEE Trans. Computers, 1998

1995

Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees.

Michael Barbehenn, Seth Hutchinson

IEEE Trans. Robotics Autom., 1995

Toward an exact incremental geometric robot motion planner.

Michael Barbehenn, Seth Hutchinson

Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, 1995

1994

An Efficient Hybrid Planner in Changing Environments.

Michael Barbehenn, Pang C. Chen, Seth Hutchinson

Proceedings of the 1994 International Conference on Robotics and Automation, 1994

1993

Efficient Search and Hierarchical Motion Planning Using Dynamic Single-Source Shortest Paths Trees.

Michael Barbehenn, Seth Hutchinson

Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

1991

An Integrated Architecture for Learning and Planning in Robotic Domains.

Michael Barbehenn, Seth Hutchinson

SIGART Bull., 1991

Learning conditional effects of actions for robot navigation.

Michael Barbehenn, Seth Hutchinson

Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991