Newsgroups: comp.robotics
Path: brunix!news.Brown.EDU!noc.near.net!howland.reston.ans.net!usc!elroy.jpl.nasa.gov!ames!saimiri.primate.wisc.edu!doug.cae.wisc.edu!chih-che
From: chih-che@cae.wisc.edu (Chih-Che Lin)
Subject: Mobil Robot Motion Planning
Organization: U of Wisconsin-Madison College of Engineering
Date: 26 Oct 93 20:31:17 CDT
Message-ID: <1993Oct26.203118.14087@doug.cae.wisc.edu>
Summary: Mobil Robot Motion Planning
Keywords: Motion Planning
References: <CFJ1uq.CD1@world.std.com>
Sender: chih-che@cae.wisc.edu
Lines: 30


Hi netters,
	I am doing a study regrading mobil robot motion planning.
	A mobil robot with two driving wheels mounted on the same axis,
	control independently, plus one free wheel. This mobil robot
	will move from start point to goal point along a optimum collision-free
	path among polyhedral obstacles.
	The algorithm that I plan to use is based on [Lozano-Perez 79],
	using growing the obstales and A* algorithm to find the optimum
	path.

	Is there anyone can give me some suggestions about this algorithm?
	What's the drawback for this algorithm?
	Is there any better algorithm for this topic?
     
	Any suggestion will be highly appreciated.

	Thanks in advance.


------------------------------------------------------------------------
|    Chih-Che (Gary) Lin                                               |
|    Graduate Student                                                  |
|    Dept. of Mechanical Engineering                                   |
|    University of Wisconsin -- Madison                                |
|    E-mail: chih-che@cae.wisc.edu                                     |
------------------------------------------------------------------------



