Newsgroups: comp.robotics
Path: brunix!news.Brown.EDU!agate!howland.reston.ans.net!xlink.net!subnet.sub.net!flatlin!faber!jr
From: jr@faber.ka.sub.org (Juerg Reinhart)
Subject: Lumelsky's Bug algorithms
Date: Tue, 15 Feb 1994 11:56:52 GMT
Message-ID: <CL9L6s.41n@faber.ka.sub.org>
Organization: -
Lines: 20

Is there anybody out there who works on Lumelsky's Bug algorithms? I
am interested in a systematic derivation of these algorithms as well
as a comparison with the solutions to the piano movers' problem in
polygonal worlds concerning their computational costs. I would be glad
if you could drop me a line about your research interests.

Thank you for attention and help

- JR


P.S.: For all those who might ask: What is he refering to? Have a look
at Lumelsky's key paper

	Lumelsky, Vladimir J., and Alexander A. Stepanov.
	"Path-planning strategies for a point mobile automaton
	moving amidst unknown obstacles of arbitrary shape."
	Algorithmica 2 (1987): 403--430.


