Sciweavers

2693 search results - page 1 / 539
» On Computing Complex Navigation Functions
Sort
View
13
Voted
ICRA
2005
IEEE
141views Robotics» more  ICRA 2005»
13 years 10 months ago
On Computing Complex Navigation Functions
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
13 years 11 months ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
FLOPS
2004
Springer
13 years 10 months ago
DDT: a Declarative Debugging Tool for Functional-Logic Languages
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
Rafael Caballero, Mario Rodríguez-Artalejo
SI3D
2003
ACM
13 years 9 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
13 years 9 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel