Searcharxiv⌕ Search

arXiv subjects

Manabu Tsukada

Publications and source records attributed to Manabu Tsukada.

50 records · Page 3Linked to original sources

Time-to-Collision-Aware Lane-Change Strategy Based on Potential Field and Cubic Polynomial for Autonomous Vehicles

Making safe and successful lane changes (LCs) is one of the many vitally important functions of autonomous vehicles (AVs) that are needed to ensure safe driving on expressways. Recently, the simplicity and real-time performance of the potential field (PF) method have been leveraged to design decision and planning modules for AVs. However, the LC trajectory planned by the PF method is usually lengthy and takes the ego vehicle laterally parallel and close to the obstacle vehicle, which creates a dangerous situation if the obstacle vehicle suddenly steers. To mitigate this risk, we propose a time-to-collision-aware LC (TTCA-LC) strategy based on the PF and cubic polynomial in which the TTC constraint is imposed in the optimized curve fitting. The proposed approach is evaluated using MATLAB/Simulink under high-speed conditions in a comparative driving scenario. The simulation results indicate that the TTCA-LC method performs better than the conventional PF-based LC (CPF-LC) method in generating shorter, safer, and smoother trajectories. The length of the LC trajectory is shortened by over 27.1\%, and the curvature is reduced by approximately 56.1\% compared with the CPF-LC method.

cs.RO↗

Potential Field-based Path Planning with Interactive Speed Optimization for Autonomous Vehicles

Path planning is critical for autonomous vehicles (AVs) to determine the optimal route while considering constraints and objectives. The potential field (PF) approach has become prevalent in path planning due to its simple structure and computational efficiency. However, current PF methods used in AVs focus solely on the path generation of the ego vehicle while assuming that the surrounding obstacle vehicles drive at a preset behavior without the PF-based path planner, which ignores the fact that the ego vehicle's PF could also impact the path generation of the obstacle vehicles. To tackle this problem, we propose a PF-based path planning approach where local paths are shared among ego and obstacle vehicles via vehicle-to-vehicle (V2V) communication. Then by integrating this shared local path into an objective function, a new optimization function called interactive speed optimization (ISO) is designed to allow driving safety and comfort for both ego and obstacle vehicles. The proposed method is evaluated using MATLAB/Simulink in the urgent merging scenarios by comparing it with conventional methods. The simulation results indicate that the proposed method can mitigate the impact of other AVs' PFs by slowing down in advance, effectively reducing the oscillations for both ego and obstacle AVs.

cs.RO↗

Occlusion-Aware Path Planning for Collision Avoidance: Leveraging Potential Field Method with Responsibility-Sensitive Safety

Collision avoidance (CA) has always been the foremost task for autonomous vehicles (AVs) under safety criteria. And path planning is directly responsible for generating a safe path to accomplish CA while satisfying other commands. Due to the real-time computation and simple structure, the potential field (PF) has emerged as one of the mainstream path-planning algorithms. However, the current PF is primarily simulated in ideal CA scenarios, assuming complete obstacle information while disregarding occlusion issues where obstacles can be partially or entirely hidden from the AV's sensors. During the occlusion period, the occluded obstacles do not possess a PF. Once the occlusion is over, these obstacles can generate an instantaneous virtual force that impacts the ego vehicle. Therefore, we propose an occlusion-aware path planning (OAPP) with the responsibility-sensitive safety (RSS)-based PF to tackle the occlusion problem for non-connected AVs. We first categorize the detected and occluded obstacles, and then we proceed to the RSS violation check. Finally, we can generate different virtual forces from the PF for occluded and non-occluded obstacles. We compare the proposed OAPP method with other PF-based path planning methods via MATLAB/Simulink. The simulation results indicate that the proposed method can eliminate instantaneous lateral oscillation or sway and produce a smoother path than conventional PF methods.

cs.RO↗

Flowsim: A Modular Simulation Platform for Microscopic Behavior Analysis of City-Scale Connected Autonomous Vehicles

As connected autonomous vehicles (CAVs) become increasingly prevalent, there is a growing need for simulation platforms that can accurately evaluate CAV behavior in large-scale environments. In this paper, we propose Flowsim, a novel simulator specifically designed to meet these requirements. Flowsim offers a modular and extensible architecture that enables the analysis of CAV behaviors in large-scale scenarios. It provides researchers with a customizable platform for studying CAV interactions, evaluating communication and networking protocols, assessing cybersecurity vulnerabilities, optimizing traffic management strategies, and developing and evaluating policies for CAV deployment. Flowsim is implemented in pure Python in approximately 1,500 lines of code, making it highly readable, understandable, and easily modifiable. We verified the functionality and performance of Flowsim via a series of experiments based on realistic traffic scenarios. The results show the effectiveness of Flowsim in providing a flexible and powerful simulation environment for evaluating CAV behavior and data flow. Flowsim is a valuable tool for researchers, policymakers, and industry professionals who are involved in the development, evaluation, and deployment of CAVs. The code of Flowsim is publicly available on GitHub under the MIT license.

cs.NI↗

zk-PoT: Zero-Knowledge Proof of Traffic for Privacy Enabled Cooperative Perception

Cooperative perception is an essential and widely discussed application of connected automated vehicles. However, the authenticity of perception data is not ensured, because the vehicles cannot independently verify the event they did not see. Many methods, including trust-based (i.e., statistical) approaches and plausibility-based methods, have been proposed to determine data authenticity. However, these methods cannot verify data without a priori knowledge. In this study, a novel approach of constructing a self-proving data from the number plate of target vehicles was proposed. By regarding the pseudonym and number plate as a shared secret and letting multiple vehicles prove they know it independently, the data authenticity problem can be transformed to a cryptography problem that can be solved without trust or plausibility evaluations. Our work can be adapted to the existing works including ETSI/ISO ITS standards while maintaining backward compatibility. Analyses of common attacks and attacks specific to the proposed method reveal that most attacks can be prevented, whereas preventing some other attacks, such as collusion attacks, can be mitigated. Experiments based on realistic data set show that the rate of successful verification can achieve 70\% to 80\% at rush hours.

cs.NI↗

MAC address randomization tolerant crowd monitoring system using Wi-Fi packets

Media access control (MAC) addresses inside Wi-Fi packets can be used for beneficial activities such as crowdedness estimation, marketing, and hazard maps. However, the MAC address randomization systems introduced around 2014 make all conventional MAC-address-based crowd monitoring systems count the same device more than once. Therefore, there is a need to create a new crowd monitoring system tolerant to MAC address randomization to estimate the number of devices accurately. In this paper, Vision and TrueSight, two new crowd monitoring algorithms that estimate the number of devices, are proposed to prove that MAC-address-based crowd monitoring is still possible. In addition to probe requests, Vision uses data packets and beacon packets to mitigate the influence of randomization. Moreover, TrueSight uses sequence numbers and hierarchical clustering to estimate the number of devices. The experimental results of this study show that even without installing any special software, Vision can gather 440 randomly generated MAC addresses into one group and count only once, and TrueSight can estimate the number of devices with an accuracy of more than 75% with an acceptable error range of 1.

cs.NI↗

WebRTC-based measurement tool for peer-to-peer applications and preliminary findings with real users

Direct peer-to-peer (P2P) communication is often used to minimize the end-to-end latency for real-time applications that require accurate synchronization, such as remote musical ensembles. However, there are few studies on the performance of P2P communication between home network environments, thus hindering the deployment of services that require synchronization. In this study, we developed a P2P performance measurement tool using the Web Real-Time Communication (WebRTC) statistics application programming interface. Using this tool, we can easily measure P2P performance between home network environments on a web browser without downloading client applications. We also verified the reliability of round-trip time (RTT) measurements using WebRTC and confirmed that our system could provide the necessary measurement accuracy for RTT and jitter measurements for real-time applications. In addition, we measured the performance of a full mesh topology connection with 10 users in an actual environment in Japan. Consequently, we found that only 66% of the peer connections had a latency of 30 ms or less, which is the minimum requirement for high synchronization applications, such as musical ensembles.

cs.NI↗

Misbehavior Detection Using Collective Perception under Privacy Considerations

In cooperative ITS, security and privacy protection are essential. Cooperative Awareness Message (CAM) is a basic V2V message standard, and misbehavior detection is critical for protection against attacking CAMs from the inside system, in addition to node authentication by Public Key Infrastructure (PKI). On the contrary, pseudonym IDs, which have been introduced to protect privacy from tracking, make it challenging to perform misbehavior detection. In this study, we improve the performance of misbehavior detection using observation data of other vehicles. This is referred to as collective perception message (CPM), which is becoming the new standard in European countries. We have experimented using realistic traffic scenarios and succeeded in reducing the rate of rejecting valid CAMs (false positive) by approximately 15 percentage points while maintaining the rate of correctly detecting attacks (true positive).

cs.CR↗

Reinforcement Learning Based Optimal Camera Placement for Depth Observation of Indoor Scenes

Exploring the most task-friendly camera setting -- optimal camera placement (OCP) problem -- in tasks that use multiple cameras is of great importance. However, few existing OCP solutions specialize in depth observation of indoor scenes, and most versatile solutions work offline. To this problem, an OCP online solution to depth observation of indoor scenes based on reinforcement learning is proposed in this paper. The proposed solution comprises a simulation environment that implements scene observation and reward estimation using shadow maps and an agent network containing a soft actor-critic (SAC)-based reinforcement learning backbone and a feature extractor to extract features from the observed point cloud layer-by-layer. Comparative experiments with two state-of-the-art optimization-based offline methods are conducted. The experimental results indicate that the proposed system outperforms seven out of ten test scenes in obtaining lower depth observation error. The total error in all test scenes is also less than 90% of the baseline ones. Therefore, the proposed system is more competent for depth camera placement in scenarios where there is no prior knowledge of the scenes or where a lower depth observation error is the main objective.

cs.CV↗

Roadside-assisted Cooperative Planning using Future Path Sharing for Autonomous Driving

Cooperative intelligent transportation systems (ITS) are used by autonomous vehicles to communicate with surrounding autonomous vehicles and roadside units (RSU). Current C-ITS applications focus primarily on real-time information sharing, such as cooperative perception. In addition to real-time information sharing, self-driving cars need to coordinate their action plans to achieve higher safety and efficiency. For this reason, this study defines a vehicle's future action plan/path and designs a cooperative path-planning model at intersections using future path sharing based on the future path information of multiple vehicles. The notion is that when the RSU detects a potential conflict of vehicle paths or an acceleration opportunity according to the shared future paths, it will generate a coordinated path update that adjusts the speeds of the vehicles. We implemented the proposed method using the open-source Autoware autonomous driving software and evaluated it with the LGSVL autonomous vehicle simulator. We conducted simulation experiments with two vehicles at a blind intersection scenario, finding that each car can travel safely and more efficiently by planning a path that reflects the action plans of all vehicles involved. The time consumed by introducing the RSU is 23.0 % and 28.1 % shorter than that of the stand-alone autonomous driving case at the intersection.

cs.RO↗

AutoMCM: Maneuver Coordination Service with Abstracted Functions for Autonomous Driving

A cooperative intelligent transport system (C-ITS) uses vehicle-to-everything (V2X) technology to make self-driving vehicles safer and more efficient. Current C-ITS applications have mainly focused on real-time information sharing, such as for cooperative perception. In addition to better real-time perception, self-driving vehicles need to achieve higher safety and efficiency by coordinating action plans. This study designs a maneuver coordination (MC) protocol that uses seven messages to cover various scenarios and an abstracted MC support service. We implement our proposal as AutoMCM by extending two open-source software tools: Autoware for autonomous driving and OpenC2X for C-ITS. The results show that our system effectively reduces the communication bandwidth by limiting message exchange in an event-driven manner. Furthermore, it shows that the vehicles run 15% faster when the vehicle speed is 30 km/h and 28% faster when the vehicle speed is 50 km/h using our scheme. Our system shows robustness against packet loss in experiments when the message timeout parameters are appropriately set.

cs.RO↗

Software Defined Media: Virtualization of Audio-Visual Services

Internet-native audio-visual services are witnessing rapid development. Among these services, object-based audio-visual services are gaining importance. In 2014, we established the Software Defined Media (SDM) consortium to target new research areas and markets involving object-based digital media and Internet-by-design audio-visual environments. In this paper, we introduce the SDM architecture that virtualizes networked audio-visual services along with the development of smart buildings and smart cities using Internet of Things (IoT) devices and smart building facilities. Moreover, we design the SDM architecture as a layered architecture to promote the development of innovative applications on the basis of rapid advancements in software-defined networking (SDN). Then, we implement a prototype system based on the architecture, present the system at an exhibition, and provide it as an SDM API to application developers at hackathons. Various types of applications are developed using the API at these events. An evaluation of SDM API access shows that the prototype SDM platform effectively provides 3D audio reproducibility and interactiveness for SDM applications.

cs.MM↗

The Role of communication and network technologies in vehicular applications

Vehicular networks attract a lot of attention in the research world. Novel vehicular applications need a suitable communication channel in order to extend in-vehicle capabilities and, be aware about surrounding events. However, these networks present some proprieties, such as high mobility or specific topologies. These properties affect the performances of applications and more effort should be directed to identify the final necessities of the network. Few works deal with application requirements which should be considered when vehicular services are designed. In this chapter this gap is filled, proposing an analysis of application requirements which considers available technologies for physical/MAC and network layers. This study contains key factors which must be taken into account not only at the designing stage of the vehicular network, but also when applications are evaluated.

cs.NI↗

On the Experimental Evaluation of Vehicular Networks: Issues, Requirements and Methodology Applied to a Real Use Case

One of the most challenging fields in vehicular communications has been the experimental assessment of protocols and novel technologies. Researchers usually tend to simulate vehicular scenarios and/or partially validate new contributions in the area by using constrained testbeds and carrying out minor tests. In this line, the present work reviews the issues that pioneers in the area of vehicular communications and, in general, in telematics, have to deal with if they want to perform a good evaluation campaign by real testing. The key needs for a good experimental evaluation is the use of proper software tools for gathering testing data, post-processing and generating relevant figures of merit and, finally, properly showing the most important results. For this reason, a key contribution of this paper is the presentation of an evaluation environment called AnaVANET, which covers the previous needs. By using this tool and presenting a reference case of study, a generic testing methodology is described and applied. This way, the usage of the IPv6 protocol over a vehicle-to-vehicle routing protocol, and supporting IETF-based network mobility, is tested at the same time the main features of the AnaVANET system are presented. This work contributes in laying the foundations for a proper experimental evaluation of vehicular networks and will be useful for many researchers in the area.

cs.NI↗