Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Building and navigating a network of local minima
Autore:
Kim, SW; Boley, D;
Indirizzi:
Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA Univ Minnesota Minneapolis MN USA 55455 & Engn, Minneapolis, MN 55455 USA
Titolo Testata:
JOURNAL OF ROBOTIC SYSTEMS
fascicolo: 8, volume: 18, anno: 2001,
pagine: 405 - 419
SICI:
0741-2223(200108)18:8<405:BANANO>2.0.ZU;2-X
Fonte:
ISI
Lingua:
ENG
Soggetto:
PATH;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
17
Recensione:
Indirizzi per estratti:
Indirizzo: Boley, D Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA Univ Minnesota Minneapolis MN USA 55455 inneapolis, MN 55455 USA
Citazione:
S.W. Kim e D. Boley, "Building and navigating a network of local minima", J ROBOTIC S, 18(8), 2001, pp. 405-419

Abstract

We present a novel method that constructs and navigates a network of localminima of potential fields defined over multidimensional spaces. Though motivated by problems of motion planning for robotic manipulators, similar techniques have been proposed for use in other domains such as molecular chemistry and drug design. The method is based on building a roadmap of paths connecting local minima of a potential function. The novel approach consistsof an up-hill search strategy used to climb out of local minima and find new nearby local minima, without doubling back on previous local minima. With this up-hill search strategy, one can find local minima otherwise difficult to encounter, and one can focus the search to specific local minima and specific directions from those local minima. The construction of the roadmap can be done in parallel with very little communication. We present extensive simulation results. (C) 2001 John Wiley & Sons, Inc.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 20/09/20 alle ore 07:28:26