๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for finding a collision-free path among polyhedral obstacles

โœ Scribed by Fu, Li-Chen ;Liu, Dong-Yueh

Book ID
112186894
Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
528 KB
Volume
7
Category
Article
ISSN
0741-2223

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for finding a pat
An efficient algorithm for finding a path subject to two additive constraints
โœ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satisยฎes a number of QoS constraints. For two or more additive constraints, the problem of ยฎnding a feasible path is NP-complete that cannot be exactly solved

An efficient and derivative-free algorit
An efficient and derivative-free algorithm for finding the minimum of a 1-D user-defined function
โœ F.X. Yu; V.P. Singh ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 634 KB

An efficient algorithm was developed for finding the minimum or maximum of a one-dimensional (I-D) user-defined function. The algorithm combined the quadratic interpolation, the Golden search, and an additional side search into a unified optimal search. Five I-D, four 2-D, and two 4-D functions were