A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on intelligent transportation systems Ročník 9; číslo 2; s. 226 - 234
Hlavní autoři: Hansuk Sohn, Lee, J.D., Bricker, D.L., Hoffman, J.D.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway, NJ IEEE 01.06.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Applied sciences
Automotive components
Automotive engineering
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Control theory. Systems
Distraction
Drivers
Driving
Dynamic programming
dynamic programming (DP)
Dynamic scheduling
Electronic mail
Exact sciences and technology
Ground, air and sea transportation, marine construction
Heuristic algorithms
in-vehicle information systems (IVISs)
Information systems. Data bases
Management information systems
Mathematical models
Memory organisation. Data processing
Messages
Navigation
Priorities
Robotics
Safety
Scheduling
Scheduling algorithm
Software
Studies
task scheduling
Tires
Distraction
dynamic programming (DP)
task scheduling
in-vehicle information systems (IVISs)
Motor car
Terms-Distraction
Navigation
Information system
Vehicle driving
Task scheduling
Scheduling
Electronic mail
Timed system
Workload
Relevance
Tyre
User interface
Planning
Dynamic programming
Safety
Dynamic model
Collision avoidance
ISSN:1524-9050, 1558-0016
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2008.922876