Lifelong Visual Localization for Automated Vehicles

نویسندگان

  • Thorsteinn Rögnvaldsson
  • Thomas Hellström
  • Peter Mühlfellner
چکیده

Automated driving can help solve the current and future problems of individual transportation. Automated valet parking is a possible approach to help with overcrowded parking areas in cities and make electric vehicles more appealing. In an automated valet system, drivers are able to drop off their vehicle close to a parking area. The vehicle drives to a free parking spot on its own, while the driver is free to perform other tasks — such as switching the mode of transportation. Such a system requires the automated car to navigate unstructured, possibly three dimensional areas. This goes beyond the scope of the tasks performed in the state of the art for automated driving. This thesis describes a visual localization system that provides accurate metric pose estimates. As sensors, the described system uses multiple monocular cameras and wheel-tick odometry. This is a sensor set-up that is close to what can be found in current production cars. Metric pose estimates with errors in the order of tens of centimeters enable maneuvers such as parking into tight parking spots. This system forms the basis for automated navigation in the EU-funded V-Charge project. Furthermore, we present an approach to the challenging problem of lifelong mapping and localization. Over long time spans, the visual appearance of the world is subject to change due to natural and man-made phenomena. The effective long-term usage of visual maps requires the ability to adapt to these changes. We describe a multi-session mapping system, that fuses datasets into

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

ثبت نام

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

منابع مشابه

Semi-quantitative segmental perfusion scoring in myocardial perfusion SPECT: visual vs. automated analysis

Introduction: It is recommended that the physician apply at least a semi-quantitative segmental scoring system in myocardial perfusion SPECT.  We aimed to assess the agreement between automated semi-quantitative analysis using QPS (quantitative Perfusion SPECT) software and visual approach for calculation of summed stress  score (SSS), summed rest score (SRS) and summed difference score (SDS). ...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

A Job Shop Scheduling and Location of Battery Charging Storage for the Automated Guided Vehicles (AGVs)

When the Automated Guided Vehicles (AGVs) are transferring the parts from one machine to another in a job shop environment, it is possible that AGVsstopon their guidepaths since their batteries are discharged.Consequently, it is essential to establish at least one Battery Charging Storage (BCS) to replace full batteries with empty batteries for the stopped AGVs. Due to non-predictable routes fo...

متن کامل

Global Localization and Position Tracking of Automatic Guided Vehicles using passive RFID Technology

Automated Guided Vehicles (AGVs) are used in warehouses, distribution centers and manufacturing plants in order to automate the internal material flow. Usually AGVs are designed to transport large and heavy transport units such as Euro-pallets or mesh pallets. Just-in-time inventory management and lean production requires small transportation units to enable one-piece-flow. A solution to meet t...

متن کامل

An Efficient Extension of Network Simplex Algorithm

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2015