Merge-by-Wire: Algorithms and System Support

Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement by-wire applications for taking smart decisions on the road or assisting the driver in doing the same. Given this proliferation, there is a need to minimize the computing power required without affecting the performance and safety of the applications. The latter is especially important since these by-wire applications are distributed and realtime in nature and hence deal with critical data and involve deadline bound computations on data gathered from the environment. These applications have stringent requirements on the freshness of data items and completion time of the tasks. Our work studies one such safety-related application namely, Automatic Merge Control (AMC) which ensures safe vehicle maneuver in the region where two or more roads intersect. As our contributions, we (i) propose two merge algorithms for AMC: Head of the Lane (HoL) and All Feasible Sequences (A...

• Type: Conference
• Year: 2008
• Where: RTSS
• Authors: Vipul Shingde, Gurulingesh Raravi, Ashish Gudhe, Prakhar Goyal, Krithi Ramamritham
• Keywords: Applied Computing, By-wire Applications, Deadline Bound Computations, RTSS 2008, Safe Vehicle Maneuver