Computational study demonstrates efficient configuration space transformations using primitive shapes in two and three dimensions, suggesting viability for real-time robotic obstacle avoidance.
A method is presented for computation of obstacle bound aries in configuration space, with particular emphasis on time efficiency. Properties of configuration space transfor mations are presented in general, and these properties are invoked in algorithms that result in highly efficient com putations. The approach depends on the definition of a set of primitives, which are themselves efficiently trans formed and may be combined logically to construct more complex transformations. The concepts are illustrated with both computed and empirically obtained configura tion space obstacles in two and three dimensions. Perfor mance data for real-time transformations are reported.
No takes yet. Share an insight, caveat, or question.
Newman et al. (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: