By Topic

A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hansuk Sohn ; Dept. of Ind. Eng., New Mexico State Univ., Las Cruces, NM ; John D. Lee ; Dennis L. Bricker ; Joshua D. Hoffman

In-vehicle information systems (IVISs) can enhance or compromise driving safety. Such systems present an array of messages that range from collision warnings and navigation instructions to tire pressure and e-mail alerts. If these messages are not properly managed, the IVIS might fail to provide the driver with critical information, which could undermine safety. In addition, if the IVIS simultaneously presents multiple messages, the driver may fail to attend to the most critical information. To date, only simple algorithms that use priority-based filters have been developed to address this problem. This paper presents a dynamic programming model that goes beyond the immediate relevance and urgency parameters of the current Society of Automotive Engineers (SAE) message scheduling algorithm. The resulting algorithm considers the variation of message value over time, which extends the planning horizon and creates a more valuable stream of messages than that based only on the instantaneous message priority. This method has the potential to improve road safety because the most relevant information is displayed to drivers across time and not just the highest priority at any given instant. Applying this algorithm to message sets shows that scheduling that considers the time-based message value, in addition to priority, results in substantially different and potentially better message sequences compared with those based only on message priority. This method can be extended to manage driver workload by adjusting message timing relative to demanding driving maneuvers.

Published in:

IEEE Transactions on Intelligent Transportation Systems  (Volume:9 ,  Issue: 2 )