Self-Aware Traffic Route Planning

نویسندگان

  • David Wilkie
  • Jur P. van den Berg
  • Ming C. Lin
  • Dinesh Manocha
چکیده

One of the most ubiquitous AI applications is vehicle route planning. While state-of-the-art systems take into account current traffic conditions or historic traffic data, current planning approaches ignore the impact of their own plans on the future traffic conditions. We present a novel algorithm for self-aware route planning that uses the routes it plans for current vehicle traffic to more accurately predict future traffic conditions for subsequent cars. Our planner uses a roadmap with stochastic, timevarying traffic densities that are defined by a combination of historical data and the densities predicted by the planned routes for the cars ahead of the current traffic. We have applied our algorithm to large-scale traffic route planning, and demonstrated that our self-aware route planner can more accurately predict future traffic conditions, which results in a reduction of the travel time for those vehicles that use our algorithm.

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

ثبت نام

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

منابع مشابه

TrafficDB: HERE's High Performance Shared-Memory Data Store

HERE’s traffic-aware services enable route planning and traffic visualisation on web, mobile and connected car applications. These services process thousands of requests per second and require efficient ways to access the information needed to provide a timely response to end-users. The characteristics of road traffic information and these traffic-aware services require storage solutions with s...

متن کامل

A Situation-aware Mobile Traffic Information System

Mobile information services will play an important role in our future work and private life. Enabling mobility in urban and populous areas needs innovative tools and novel techniques for individual traffic planning. However, though there already are navigation systems featuring route planning, their usability is often difficult, because neither current information nor personal user preferences ...

متن کامل

Comparing context-aware routing and local intersection management

In multi-agent routing, there is a set of mobile agents each with a start location and destination location on a shared infrastructure. An agent wants to reach his destination as quickly as possible, but conflicts with other agents must be avoided. We have previously developed a single-agent route planning algorithm that can find a shortest-time route that does not conflict with any previously ...

متن کامل

Dealing with Uncertainty in Operational Transport Planning

An important problem in transportation is how to ensure efficient operational route planning when several vehicles share a common road infrastructure with limited capacity. Examples of such a problem are route planning for automated guided vehicles in a terminal and route planning for aircraft taxiing at airports. Maintaining efficiency in such transport planning scenarios can be difficult for ...

متن کامل

Bandwidth Allocation for Broadband Transport Network

⎯This paper proposes a bandwidth allocation process for a single broadband network traffic source. In recent years, broadband traffic source has been proved that it has self-similarity and self-similar model that is well fit to the broadband network traffic sources. The bandwidth allocation problem is very important in network planning. The network planning problems such as call admission contr...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2011