Automated platoon manipulation in merging scenarios using trajectory estimation of connected vehicles

2019 ◽  
Author(s):  
Rory Alston ◽  
Daniel Pierce ◽  
Patrick Smith ◽  
David Bevly ◽  
Scott Heim
Keyword(s):  
Connected Vehicles ◽  
Trajectory Estimation

An Edge-Computing Based Task-Unloading Technique with Privacy Protection for Internet of Connected Vehicles

2021 ◽  
Author(s):  
Hasnain Ali Almashhadani ◽  
Xiaoheng Deng ◽  
Suhaib Najeh Abdul Latif ◽  
Mohammed Mohsin Ibrahim ◽  
Ali Hussien Alshammari
Keyword(s):  
Privacy Protection ◽  
Edge Computing ◽  
Connected Vehicles

scholarly journals Trajectory estimation and position correction for hopping robot navigation using monocular camera

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Gabor Kovacs ◽  
Yasuharu Kunii ◽  
Takao Maeda ◽  
Hideki Hashimoto
Keyword(s):  
Robot Navigation ◽  
Trajectory Estimation ◽  
Monocular Camera ◽  
Hopping Robot ◽  
Position Correction

scholarly journals You Only Look Once, But Compute Twice: Service Function Chaining for Low-Latency Object Detection in Softwarized Networks

2021 ◽  
Vol 11 (5) ◽  
pp. 2177
Author(s):  
Zuo Xiang ◽  
Patrick Seeling ◽  
Frank H. P. Fitzek
Keyword(s):  
Machine Learning ◽  
Object Detection ◽  
Low Latency ◽  
Connected Vehicles ◽  
Network Nodes ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Broad Variety ◽  
Computational Resources ◽  
Service Latency

With increasing numbers of computer vision and object detection application scenarios, those requiring ultra-low service latency times have become increasingly prominent; e.g., those for autonomous and connected vehicles or smart city applications. The incorporation of machine learning through the applications of trained models in these scenarios can pose a computational challenge. The softwarization of networks provides opportunities to incorporate computing into the network, increasing flexibility by distributing workloads through offloading from client and edge nodes over in-network nodes to servers. In this article, we present an example for splitting the inference component of the YOLOv2 trained machine learning model between client, network, and service side processing to reduce the overall service latency. Assuming a client has 20% of the server computational resources, we observe a more than 12-fold reduction of service latency when incorporating our service split compared to on-client processing and and an increase in speed of more than 25% compared to performing everything on the server. Our approach is not only applicable to object detection, but can also be applied in a broad variety of machine learning-based applications and services.

Sequential Optimization of an Emergency Response Vehicle’s Intra-Link Movement in a Partially Connected Vehicle Environment

2021 ◽  
pp. 036119812110179
Author(s):  
Gaby Joe Hannoun ◽  
Pamela Murray-Tuite ◽  
Kevin Heaslip ◽  
Thidapat Chantem
Keyword(s):  
Emergency Response ◽  
Lateral Position ◽  
Automated System ◽  
Sequential Optimization ◽  
Connected Vehicles ◽  
Linear Programs ◽  
Connected Vehicle ◽  
Market Penetration ◽  
Short Term ◽  
New Approach

This paper introduces a semi-automated system that facilitates emergency response vehicle (ERV) movement through a transportation link by providing instructions to downstream non-ERVs. The proposed system adapts to information from non-ERVs that are nearby and downstream of the ERV. As the ERV passes stopped non-ERVs, new non-ERVs are considered. The proposed system sequentially executes integer linear programs (ILPs) on transportation link segments with information transferred between optimizations to ensure ERV movement continuity. This paper extends a previously developed mathematical program that was limited to a single short segment. The new approach limits runtime overhead without sacrificing effectiveness and is more suitable to dynamic systems. It also accommodates partial market penetration of connected vehicles using a heuristic reservation approach, making the proposed system beneficial in the short-term future. The proposed system can also assign the ERV to a specific lateral position at the end of the link, a useful capability when next entering an intersection. Experiments were conducted to develop recommendations to reduce computation times without compromising efficiency. When compared with the current practice of moving to the nearest edge, the system reduces ERV travel time an average of 3.26 s per 0.1 mi and decreases vehicle interactions.

Sign in / Sign up

Export Citation Format

Share Document