Many Looks Before a Leap

نویسندگان

  • Xiaotie Deng
  • Evangelos Milios
چکیده

We are interested in the problem of map construction of an unknown environment. Even with a complete map, navigation of real autonomous mobile robots is still conducted with imperfect information. This can be caused by various factors, such as imperfect sensors, imperfect mechanical control capabilities, and imperfect road conditions. Computational resource constraints for real time performance may also prevent us from collecting and processing complete information about the environment. A major problem caused by these issues is that accummulated errors in the robot’s self-localization may become arbitrarily large as the robot moves on. Therefore, in addition to the map, we would still need a strategy to help robots recognize the environment along the way and to guide movements toward the destination. This is called the guidance problem by Levitt and Lawton (Levitt & Lawton 1990). We discuss an approach for the guidance problem using imprecise data, in the context of world models that are represented by maps with qualitative/topological information for the global environment, and quantitative/geometric information for the local environment, as suggested by Levitt and Lawton (Levitt & Lawton 1990), Kuipers and Levitt (Kuipers & Levitt 1988). We allow the robot to be equipped with a constant number of sensors. We consider three cost measures: mechanical, sensing, and computation in decreasing order of importance. We propose a number of algorithms with their associated cost measures using a veriety of sensor/measurement devices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leap Before You Look: Information Gathering in the PUCCINI Planner

Most of the work in planning with incomplete informa tion takes a look before you leap perspective Ac tions must be guaranteed to have their intended e ects before they can be executed We argue that this ap proach is impossible to follow in many real world do mains The agent may not have enough information to ensure that an action will have a given e ect in advance of executing it This paper de...

متن کامل

A Time-Based Key Management Protocol for Wireless Sensor Networks

It is not easy to achieve secure key establishment in wireless sensor networks without public key cryptography. Many key management protocols have been proposed for the purpose. Among them, LEAP is a simple and elegant protocol that establishes multi-level keys in an efficient way, but its security mainly relies on that of a single initialization key. Though it is assumed that the initial deplo...

متن کامل

Cryo-electron microscopy of chromatin biology

The basic unit of chromatin, the nucleosome core particle (NCP), controls how DNA in eukaryotic cells is compacted, replicated and read. Since its discovery, biochemists have sought to understand how this protein-DNA complex can help to control so many diverse tasks. Recent electron-microscopy (EM) studies on NCP-containing assemblies have helped to describe important chromatin transactions at ...

متن کامل

A study on some properties of leap graphs

In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...

متن کامل

Merging medical practices: look before you leap.

Current changes in health care are forcing many physicians to merge their medical practices. Because any successful merger requires careful planning, there are many critical issues that should be reviewed, discussed, and decided by physicians considering merging their medical practices. This article explores some of these issues and provides a useful practice merger checklist.

متن کامل

On leap Zagreb indices of graphs

The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002