Evolutionary Decision-Making and Planning for Autonomous Driving Based on Safe and Rational Exploration and Exploitation

Decision-making and motion planning are extremely important in autonomous driving to ensure safe driving in a real-world environment.This study proposes an online evolutionary decision-making and motion planning framework for autonomous driving based on a hybrid data-and model-driven method.First,a data-driven decision-making module based on deep reinforcement learning(DRL)is developed to pursue a rational driving performance as much as possible.Then,model predictive control(MPC)is employed to execute both longitudinal and lateral motion planning tasks.Multiple constraints are defined according to the vehicle’s physical limit to meet the driving task requirements.Finally,two principles of safety and rationality for the self-evolution of autonomous driving are proposed.A motion envelope is established and embedded into a rational exploration and exploitation scheme,which filters out unreasonable experiences by masking unsafe actions so as to collect high-quality training data for the DRL agent.Experiments with a high-fidelity vehicle model and MATLAB/Simulink co-simulation environment are conducted,and the results show that the proposed online-evolution framework is able to generate safer,more rational,and more efficient driving action in a real-world environment.

An integrated spatial planning of the mountainous landscapes for ski sports in a case area at the eastern Türkiye

Mountainous regions have disadvantages in economic development because of harsh physical and climatic conditions.However,winter tourism activities are one of the key components for supporting economic development in the highlands.Establishing a ski resort area supports direct and indirect employment in a region,and it stops immigration from mountainous regions to other places.This research aimed to assess the potential ski areas using a multi criteria evaluation technique in the Van region which is located in the eastern part of Türkiye.In this context,snow cover duration,sun effect,slope,slope length,elevation,population density,distance from main roads and lake visibility were used as input factors in the decision making process.Each factor was standardized using a fuzzy technique based on existing well-known ski centers in Türkiye.The weight of inputs was defined by applying a survey to the professional skiers.The most important factors were detected as transportation opportunities and snow covers whereas,the least important factors were elevation and population density.Additionally,lake visibility was very important to make a difference from other existing facilities in the region.Therefore,it was included as constraints and lake visible areas were extracted at the final stage of the research.Potential ski areas were mapped in three levels as professional,intermediate and beginner skiers.One of the suitable areas was selected as a sample projection and for the 3D simulation of the ski investment area.Potential costs and benefits were discussed.It was found that a ski tourism area investment can be amortized in 3 years in the region.

Inverted Modelling:An Effective Way to Support Motion Planning of Legged Mobile Robots

This paper presents an effective way to support motion planning of legged mobile robots—Inverted Modelling,based on the equivalent metamorphic mechanism concept.The difference from the previous research is that we herein invert the equivalent parallel mechanism.Assuming the leg mechanisms are hybrid links,the body of robot being considered as fixed platform,and ground as moving platform.The motion performance is transformed and measured in the body frame.Terrain and joint limits are used as input parameters to the model,resulting in the representation which is independent of terrains and particular poses in Inverted Modelling.Hence,it can universally be applied to any kind of legged robots as global motion performance framework.Several performance measurements using Inverted Modelling are presented and used in motion performance evaluation.According to the requirements of actual work like motion continuity and stability,motion planning of legged robot can be achieved using different measurements on different terrains.Two cases studies present the simulations of quadruped and hexapod robots walking on rugged roads.The results verify the correctness and effectiveness of the proposed method.

MPC-based Motion Planning and Control Enables Smarter and Safer Autonomous Marine Vehicles:Perspectives and a Tutorial Survey

Autonomous marine vehicles(AMVs)have received considerable attention in the past few decades,mainly because they play essential roles in broad marine applications such as environmental monitoring and resource exploration.Recent advances in the field of communication technologies,perception capability,computational power and advanced optimization algorithms have stimulated new interest in the development of AMVs.In order to deploy the constrained AMVs in the complex dynamic maritime environment,it is crucial to enhance the guidance and control capabilities through effective and practical planning,and control algorithms.Model predictive control(MPC)has been exceptionally successful in different fields due to its ability to systematically handle constraints while optimizing control performance.This paper aims to provide a review of recent progress in the context of motion planning and control for AMVs from the perceptive of MPC.Finally,future research trends and directions in this substantial research area of AMVs are highlighted.

Energy-Efficient UAVs Coverage Path Planning Approach

Unmanned aerial vehicles(UAVs),commonly known as drones,have drawn significant consideration thanks to their agility,mobility,and flexibility features.They play a crucial role in modern reconnaissance,inspection,intelligence,and surveillance missions.Coverage path planning(CPP)which is one of the crucial aspects that determines an intelligent system’s quality seeks an optimal trajectory to fully cover the region of interest(ROI).However,the flight time of the UAV is limited due to a battery limitation and may not cover the whole region,especially in large region.Therefore,energy consumption is one of the most challenging issues that need to be optimized.In this paper,we propose an energy-efficient coverage path planning algorithm to solve the CPP problem.The objective is to generate a collision-free coverage path that minimizes the overall energy consumption and guarantees covering the whole region.To do so,the flight path is optimized and the number of turns is reduced to minimize the energy consumption.The proposed approach first decomposes the ROI into a set of cells depending on a UAV camera footprint.Then,the coverage path planning problem is formulated,where the exact solution is determined using the CPLEX solver.For small-scale problems,the CPLEX shows a better solution in a reasonable time.However,the CPLEX solver fails to generate the solution within a reasonable time for large-scale problems.Thus,to solve the model for large-scale problems,simulated annealing forCPP is developed.The results show that heuristic approaches yield a better solution for large-scale problems within amuch shorter execution time than the CPLEX solver.Finally,we compare the simulated annealing against the greedy algorithm.The results show that simulated annealing outperforms the greedy algorithm in generating better solution quality.

The Multi-Scale Numerical Modeling System for Research on the Relationship between Urban Planning and Meteorological Environment

Considering the urban characteristics, a customized multi-scale numerical modeling system is established to simulate the urban meteorological environment. The system mainly involves three spatial scales: the urban scale, urban sub-domain scale, and single to few buildings scale. In it, different underlying surface types are employed, the building drag factor is used to replace its roughness in the influence on the urban wind field, the effects of building distribution, azimuth and screening of shortwave radiation are added, and the influence of anthropogenic heating is also taken into account. All the numerical tests indicate that the simulated results are reasonably in agreement with the observational data, so the system can be used to simulate the urban meteorological environment. Making use of it, the characteristics of the meteorological environment from the urban to urban sub-domain scales, even the among-buildings scale, can be recognized. As long as the urban planning scheme is given, the corresponding simulated results can be obtained so as to meet the need of optimizing urban planning.

A Flexible Multi-Layer Map Model Designed for Lane-Level Route Planning in Autonomous Vehicles

An increasing number of drivers are relying on digital map navigation systems in vehicles or mobile phones to select optimal driving routes in order to save time and improve safety. In the near future, digital map navigation systems are expected to play more important roles in transportation systems. In order to extend current navigation systems to more applications, two fundamental problems must be resolved: the lane-level map model and lane-level route planning. This study proposes solutions to both problems. The current limitation of the lane-level map model is not its accuracy but its flexibility;this study proposes a novel seven-layer map structure, called as Tsinghua map model, which is able to support autonomous driving in a flexible and efficient way. For lane-level route planning, we propose a hierarchical route-searching algorithm to accelerate the planning process, even in the presence of complicated lane networks. In addition, we model the travel costs allocated for lane-level road networks by analyzing vehicle maneuvers in traversing lanes, changing lanes, and turning at intersections. Tests were performed on both a grid network and a real lane-level road network to demonstrate the validity and efficiency of the proposed algorithm.

Non-smooth environment modeling and global path planning for mobile robots

An Approximate Voronoi Boundary Network is constructed as the environmental model by way of enlar-ging the obstacle raster. The connectivity of the path network under complex environment is ensured through build-ing the second order Approximate Voronoi Boundary Network after adding virtual obstacles at joint-close grids. Thismethod embodies the network structure of the free area of environment with less nodes, so the complexity of pathplanning problem is reduced largely. An optimized path for mobile robot under complex environment is obtainedthrough the Genetic Algorithm based on the elitist rule and re-optimized by using the path-tightening method. Sincethe elitist one has the only authority of crossover, the management of one group becomes simple, which makes forobtaining the optimized path quickly. The Approximate Voronoi Boundary Network has a good tolerance to the im-precise a priori information and the noises of sensors under complex environment. Especially it is robust in dealingwith the local or partial changes, so a small quantity of dynamic obstacles is difficult to alter the overall character ofits connectivity, which means that it can also be adopted in dynamic environment by fusing the local path planning.

Modeling of UAV path planning based on IMM under POMDP framework

In order to enhance the capability of tracking targets autonomously of unmanned aerial vehicle (UAV), the partially observable Markov decision process (POMDP) model for UAV path planning is established based on the POMDP framework. The elements of the POMDP model are analyzed and described. The state transfer law in the model can be described by the method of interactive multiple model (IMM) due to the diversity of the target motion law, which is used to switch the motion model to accommodate target maneuvers, and hence improving the tracking accuracy. The simulation results show that the model can achieve efficient planning for the UAV route, and effective tracking for the target. Furthermore, the path planned by this model is more reasonable and efficient than that by using the single state transition law.

Emergency Tasks Planning Based on Formal Modeling of Emergency Plan and HTN Planning System SHOP2

A theoretical approach of ordered emergency tasks generation is proposed for dealing with a specific emergency event rapidly, exactly and effectively. According to the general principles of an emergency plan developed to response to an emergency management, a workflow model is employed to complete the formal modeling of concrete emergency plan firstly. Then the HTN planning system SHOP2 is introduced, the transformation method of domain knowledge from emergency domain to SHOP2 domain is studied. At last, the general procedure to solve the emergency decision prob-lems and to generate executive emergency tasks is set up drawing support from SHOP2 planning system, which will combine the principles (or knowledge) of emergency plan and the real emergency situations.

Nonlinear optimal model and solving algorithms for platform planning problem in battlefield

Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange(PWE)method are used to maximize multiple tasks completion qualities.Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.

An Intelligent Master Model of Computer Aided Process Planning for Large Complicated Stampings

Process planning for large complicated stampings is more complicated, illegible and multiform than that for common stampings. In this paper, an intelligent master model of computer aided process planning （CAPP） for large complicated stampings has been developed based on knowledge based engineering （KBE） and feature technology. This innovative model consists of knowledge base （KB）, process control structure （PCS）, process information model （PIM）, multidisciplinary design optimization （MDO）, model link environment （MLE） and simulation engine （SE）, to realize process planning, optimization, simulation and management integrated to complete intelligent CAPP system. In this model, KBE provides knowledge base, open architecture and knowledge reuse ability to deal with the multi-domain and multi-expression of process knowledge, and forms an integrated environment. With PIM, all the knowledge consisting of objects, constraints, cxtmricncc and decision-makings is carried by object-oriented method dynamically for knowledge-reasoning. PCS makes dynamical knowledge modified and updated timely and accordingly. MLE provides scv. cral methods to make CAPP sysmm associated and integrated. SE provides a programmable mechanism to interpret simulation course and result. Meanwhile, collaborative optimization, one method of MDO, is imported to deal with the optimization distributed for multiple purposes. All these make CAPP sysmm integrated and open to other systems, such as dic design and manufacturing system.

Multiproduct and multistage integrated production planning model and algorithm based on an available production capacity network

This research attempts to devise a multistage and multiproduct short-term integrative production plan that can dynamically change based on the order priority and virtual occupancy for application in steel plants. Considering factors such as the delivery time, varietal compatibility between different products, production capacity of variety per hour, minimum or maximum batch size, and transfer time, we propose an available production capacity network with varietal compatibility and virtual occupancy for enhancing production plan implementation and quick adjustment in the case of dynamic production changes. Here available means the remaining production capacity after virtual occupancy.To quickly build an available production capacity network and increase the speed of algorithm solving, constraint selection and cutting methods with order priority were used for model solving. Finally, the genetic algorithm improved with local search was used to optimize the proposed production plan and significantly reduce the order delay rate. The validity of the proposed model and algorithm was numerically verified by simulating actual production practices. The simulation results demonstrate that the model and improved algorithm result in an effective production plan.

Space station short-term mission planning using ontology modelling and time iteration

This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time of the astronauts properly. A domain model is developed by using the ontology theory to describe the concepts, constraints and relations of the planning domain formally, abstractly and normatively. A method based on time iteration is adopted to solve the short-term planning problem. Meanwhile, the resolving strategies are proposed to resolve different kinds of conflicts induced by the constraints of power, heat, resource, astronaut and relationship. The proposed approach is evaluated in a test case with fifteen missions, thirteen resources and three astronauts. The results show that the developed domain ontology model is reasonable, and the time iteration method using the proposed resolving strategies can successfully obtain the plan satisfying all considered constraints.

UAV penetration mission path planning based on improved holonic particle swarm optimization

To meet the requirements of safety, concealment, and timeliness of trajectory planning during the unmanned aerial vehicle(UAV) penetration process, a three-dimensional path planning algorithm is proposed based on improved holonic particle swarm optimization(IHPSO). Firstly, the requirements of terrain threat, radar detection, and penetration time in the process of UAV penetration are quantified. Regarding radar threats, a radar echo analysis method based on radar cross section(RCS)and the spatial situation is proposed to quantify the concealment of UAV penetration. Then the structure-particle swarm optimization(PSO) algorithm is improved from three aspects.First, the conversion ability of the search strategy is enhanced by using the system clustering method and the information entropy grouping strategy instead of random grouping and constructing the state switching conditions based on the fitness function.Second, the unclear setting of iteration numbers is addressed by using particle spacing to create the termination condition of the algorithm. Finally, the trajectory is optimized to meet the intended requirements by building a predictive control model and using the IHPSO for simulation verification. Numerical examples show the superiority of the proposed method over the existing PSO methods.

Integration of Location-Allocation and Accessibility Models in GIS to Improve Urban Planning for Health Services in Al-Madinah Al-Munawwarah, Saudi Arabia

In this study, accessibility and location-allocation models have been integrated into GIS to improve spatial planning and environmental sustainability of health services in Al-Madinah Al-Munawwarah. This integration provides a planning framework in order to check the efficiency of the spatial allocation of health services and to generate alternatives either by proposing an active service or to improve an existing one. To achieve these objectives, the accessibility to the service area was analyzed within the analysis of health services networks, which are divided into eight types: public hospitals, specialized hospitals, health units, healthcare centers, infirmaries, clinic complexes, the Red Crescent Center, and ambulance facilities, with time intervals of (5 minutes - 10 minutes - 15 minutes) to access coverage ranges, and the location-allocation model was used based on the maximum coverage model within a response time not exceeding 15 minutes, The results of the study revealed the poor distribution of health services Al-Madinah Al-Munawwarah suffers from weak accessibility to health services coverage areas and is unable to meet the needs of its population at present. The current need for health services reached twenty-four locations, including two public hospitals, three specialized hospitals, two health centers, three ambulance facilities, four infirmaries, three clinic complexes, four health units, and three Red Crescent centers.

HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS

At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows： （1） Minimizing deviation of customer＇s requirements. （2） Maximizing the profit. （3） Minimizing the frequencies of changes in formula production. （4） Minimizing the inventory of final products. （5） Balancing the production sections with regard to rate in production. （6） Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that＇s how it is solved.

Research on Model and Algorithm of Task Allocation and Path Planning for Multi-Robot

Based on the modeling of robot working environment, the shortest distance matrix between points is solved by Floyd algorithm. With the objective of minimizing the sum of the fixed cost of robot and the cost of robot operation, an integer programming model is established and a genetic algorithm for solving the model is designed. In order to make coordination to accomplish their respective tasks for each robot with high efficiency, this paper uses natural number encoding way. The objective function is based on penalty term constructed with the total number of collisions in the running path of robots. The fitness function is constructed by using the objective function with penalty term. Based on elitist retention strategy, a genetic algorithm with collision detection is designed. Using this algorithm for task allocation and path planning of multi-robot, it can effectively avoid or reduce the number of collisions in the process of multi-robot performing tasks. Finally, an example is used to validate the method.

Research on the Model of General Landscape Planning of City Road System

This paper analyses the overall landscape framework of city road system in ancient and modern China, using the ideal state terrain model which was fi rst recorded by the construction system of the Zhou Dynasty, and summarizes the ideal model of overall landscape framework of city road system, based on Chinese psychological needs of landscape, and conducts the applied research taking Nanchong in Sichuan, China for example.

Research on AGV task path planning based on improved A^(*) algorithm

Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.