ar X iv : 1 30 4 . 37 78 v 1 [ cs . S Y ] 1 3 A pr 2 01 3 Optimal Control Theory in Intelligent Transportation Systems Research - A Review

نویسندگان

  • Wei WANG
  • Stephen Shaoyi LIAO
چکیده

Continuous motorization and urbanization around the globe leads to an expansion of population in major cities. Therefore, ever-growing pressure imposed on the existing mass transit systems calls for a better technology, Intelligent Transportation Systems (ITS), to solve many new and demanding management issues. Many studies in the extant ITS literature attempted to address these issues within which various research methodologies were adopted. However, there is very few paper summarized what does optimal control theory (OCT), one of the sharpest tools to tackle management issues in engineering, do in solving these issues. It’s both important and interesting to answer the following two questions. (1) How does OCT contribute to ITS research objectives? (2) What are the research gaps and possible future research directions? We searched 11 top transportation and control journals and reviewed 41 research articles in ITS area in which OCT was used as the main research methodology. We categorized the articles by four different ways to address our research questions. We can conclude from the review that OCT is widely used to address various aspects of management issues in ITS within which a large portion of the studies aimed to reduce traffic congestion. We also critically discussed these studies and pointed out some possible future research directions towards which OCT can be used.

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

ثبت نام

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

منابع مشابه

ar X iv : h ep - t h / 01 04 16 1 v 1 1 9 A pr 2 00 1 Gravitating monopoles in SU ( 3 ) gauge theory

We consider the Einstein-Yang-Mills-Higgs equations for an SU(3) gauge group in a spherically symmetric ansatz. Several properties of the gravitating monopole solutions are obtained an compared with their SU(2) counterpart.

متن کامل

Introduction to Judea Pearl's Do-Calculus

This is a purely pedagogical paper with no new results. The goal of the paper is to give a fairly self-contained introduction to Judea Pearl’s do-calculus, including proofs of his 3 rules. 1 ar X iv :1 30 5. 55 06 v1 [ cs .A I] 2 6 A pr 2 01 3

متن کامل

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while ...

متن کامل

ar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy Joshua Joy

In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...

متن کامل

ar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy

In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2013