Global Planning Method for Visiting Roads with Parking Spaces in Priority using Rural Postman Problem*

Author(s):  
Minsoo Kim ◽  
Joonwoo Ahn ◽  
Jaeheung Park
Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 614
Author(s):  
Xingyu Li ◽  
Bo Tang ◽  
John Ball ◽  
Matthew Doude ◽  
Daniel W. Carruth

Perception, planning, and control are three enabling technologies to achieve autonomy in autonomous driving. In particular, planning provides vehicles with a safe and collision-free path towards their destinations, accounting for vehicle dynamics, maneuvering capabilities in the presence of obstacles, traffic rules, and road boundaries. Existing path planning algorithms can be divided into two stages: global planning and local planning. In the global planning stage, global routes and the vehicle states are determined from a digital map and the localization system. In the local planning stage, a local path can be achieved based on a global route and surrounding information obtained from sensors such as cameras and LiDARs. In this paper, we present a new local path planning method, which incorporates a vehicle’s time-to-rollover model for off-road autonomous driving on different road profiles for a given predefined global route. The proposed local path planning algorithm uses a 3D occupancy grid and generates a series of 3D path candidates in the s-p coordinate system. The optimal path is then selected considering the total cost of safety, including obstacle avoidance, vehicle rollover prevention, and comfortability in terms of path smoothness and continuity with road unevenness. The simulation results demonstrate the effectiveness of the proposed path planning method for various types of roads, indicating its wide practical applications to off-road autonomous driving.


2021 ◽  
Vol 11 (16) ◽  
pp. 7378
Author(s):  
Hongchao Zhuang ◽  
Kailun Dong ◽  
Yuming Qi ◽  
Ning Wang ◽  
Lei Dong

In order to effectively solve the inefficient path planning problem of mobile robots traveling in multiple destinations, a multi-destination global path planning algorithm is proposed based on the optimal obstacle value. A grid map is built to simulate the real working environment of mobile robots. Based on the rules of the live chess game in Go, the grid map is optimized and reconstructed. This grid of environment and the obstacle values of grid environment between each two destination points are obtained. Using the simulated annealing strategy, the optimization of multi-destination arrival sequence for the mobile robot is implemented by combining with the obstacle value between two destination points. The optimal mobile node of path planning is gained. According to the Q-learning algorithm, the parameters of the reward function are optimized to obtain the q value of the path. The optimal path of multiple destinations is acquired when mobile robots can pass through the fewest obstacles. The multi-destination path planning simulation of the mobile robot is implemented by MATLAB software (Natick, MA, USA, R2016b) under multiple working conditions. The Pareto numerical graph is obtained. According to comparing multi-destination global planning with single-destination path planning under the multiple working conditions, the length of path in multi-destination global planning is reduced by 22% compared with the average length of the single-destination path planning algorithm. The results show that the multi-destination global path planning method of the mobile robot based on the optimal obstacle value is reasonable and effective. Multi-destination path planning method proposed in this article is conducive to improve the terrain adaptability of mobile robots.


CICTP 2020 ◽  
2020 ◽  
Author(s):  
Yunlin Guan ◽  
Yun Wang ◽  
Xuedong Yan ◽  
Haonan Guo ◽  
Yan Huang

2013 ◽  
Vol 133 (10) ◽  
pp. 746-752 ◽  
Author(s):  
Chihaya Murakami ◽  
Aya Fujiwara ◽  
Shinichi Iwamoto

2006 ◽  
Vol 105 (Supplement) ◽  
pp. 2-4 ◽  
Author(s):  
James G. Douglas ◽  
Robert Goodkin

ObjectIn a substantial number of patients treated at the authors' facility for brain metastases, additional lesions are identified at the time of Gamma Knife surgery (GKS). These lesions are often widely dispersed and may number over 10, which is the maximal number of matrices that can be currently placed for treatment with Leksell Gamma-Plan 4C. The authors describe a simple planning method for GKS in patients with multiple, widely dispersed central nervous system (CNS) metastases.MethodsTwo patients presented with three to five identified recurrent metastases from non–small cell lung carcinoma and breast carcinoma after having received whole-brain radiotherapy. At the time of treatment with GKS in each patient, spoiled-gradient Gd-enhanced magnetic resonance (MR) imaging revealed substantially more metastases than originally thought, which were widely scattered throughout all regions of the brain. The authors simplified the treatment planning approach by dividing the entire CNS contents into six contiguous, nonoverlapping matrices, which allowed for the planning, calculation, and treatment of all lesions.Two patients were successfully treated with GKS for more than 10 CNS metastases by using this simple planning method. Differing peripheral doses to varied-size lesions were delivered by prescribing to different isodose curves within any given matrix when required. Dose–volume histograms showed brain doses as follows: 10% of the total brain volume received 5 to 6.4 Gy; 25% received 3.8 to 4.8 Gy; 50% received 2.7 to 3.1 Gy; and 75% received 2.2 to 2.5 Gy.Conclusions The delineation of more metastases than appreciated on the diagnostic MR imaging is a common occurrence at the time of GKS at the authors' institution. The treatment of multiple (>10), widely dispersed CNS metastases can be simplified by the placement of multiple, contiguous, non-overlapping matrices, which can be employed to treat lesions in all areas of the brain when separate matrices cannot be utilized.


Sign in / Sign up

Export Citation Format

Share Document