The Experts below are selected from a list of 6165 Experts worldwide ranked by ideXlab platform
Paul Newman - One of the best experts on this subject based on the ideXlab platform.
-
Using incomplete online metric maps for topological exploration with the gap Navigation Tree
Proceedings - IEEE International Conference on Robotics and Automation, 2008Co-Authors: Liz Murphy, Paul NewmanAbstract:This paper presents a general, global approach to the problem of robot exploration, utilizing a topological data structure to guide an underlying Simultaneous Localization and Mapping (SLAM) process. A Gap Navigation Tree (GNT) is used to motivate global target selection and occluded regions of the environment (called "gaps") are tracked probabilistically. The process of map construction and the motion of the vehicle alters both the shape and location of these regions. The use of online mapping is shown to reduce the difficulties in implementing the GNT.
Liz Murphy - One of the best experts on this subject based on the ideXlab platform.
-
Using incomplete online metric maps for topological exploration with the gap Navigation Tree
Proceedings - IEEE International Conference on Robotics and Automation, 2008Co-Authors: Liz Murphy, Paul NewmanAbstract:This paper presents a general, global approach to the problem of robot exploration, utilizing a topological data structure to guide an underlying Simultaneous Localization and Mapping (SLAM) process. A Gap Navigation Tree (GNT) is used to motivate global target selection and occluded regions of the environment (called "gaps") are tracked probabilistically. The process of map construction and the motion of the vehicle alters both the shape and location of these regions. The use of online mapping is shown to reduce the difficulties in implementing the GNT.
Charles Bordenave - One of the best experts on this subject based on the ideXlab platform.
-
Navigation on a poisson point process
Annals of Applied Probability, 2008Co-Authors: Charles BordenaveAbstract:On a locally finite point set, a Navigation defines a path through the point set from a point to an other. The set of paths leading to a given point defines a Tree, the Navigation Tree. In this article, we analyze the properties of the Navigation Tree when the point set is a Poisson point process on $R^d$. We examine the distribution of stable functionals, the local weak convergence of the Navigation Tree, the asymptotic average of a functional along a path, the shape of the Navigation Tree and its topological ends. We illustrate our work in the small world graphs, and new results are established. This work is motivated by applications in computational geometry and in self-organizing networks.
-
Navigation on a poisson point process
arXiv: Probability, 2006Co-Authors: Charles BordenaveAbstract:On a locally finite point set, a Navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a Tree known as the Navigation Tree. In this article, we analyze the properties of the Navigation Tree when the point set is a Poisson point process on $\mathbb{R}^d$. We examine the local weak convergence of the Navigation Tree, the asymptotic average of a functional along a path, the shape of the Navigation Tree and its topological ends. We illustrate our work in the small-world graphs where new results are established.
Jiang Qiming - One of the best experts on this subject based on the ideXlab platform.
-
achievement of dynamic Navigation Tree based on asp net
Computer Knowledge and Technology, 2008Co-Authors: Jiang QimingAbstract:This paper on the basis of the development experience of " Interactive Online Educational Management System ",using TreeView control provide by ASP.NET,combine SQL Server database table,adopt the depth spreading recursion algorithm has been realized dynamic navigating Tree,and has carried on the analysis of performance to the algorithm.
Wang Xiaobo - One of the best experts on this subject based on the ideXlab platform.
-
dynamic Navigation Tree based on ajax technique
Microcomputer Information, 2010Co-Authors: Wang XiaoboAbstract:The paper describes the use of Ajax to achieve dynamic Tree methods and principles, as well as dynamic Tree and static Tree scope of application. Show by example how to build a dynamic Navigation Tree, in Domino applications, can be a very good solution to a Tree by a large amount of data to build the case, not only avoided the issue of Domino's own 32K, but also for large data projects the realization of the Tree provides a new way, to improve system efficiency for the provision of a train of thought.
