Ant Colony Algorithm Applied to Dynamic Path Planning Method in Congested Environment

An ant colony algorithm and dynamic path technology, applied in the field of transportation, can solve problems such as delay in travel time, failure to consider the impact of environmental travel, slow progress of vehicles, etc., and achieve the effect of improving accuracy

Active Publication Date: 2021-05-25
UNIV OF ELECTRONICS SCI & TECH OF CHINA +1
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] Existing path planning algorithms, in the application of traffic network, generally only quickly find the shortest path between two points in the traffic road network, without considering the impact of the environment on travel
The environment, especially the congested environment, has a great impact on travel. In the congested environment, the shortest path between two points often has the problems of severe congestion, slow moving vehicles, and long waiting time, which seriously delays travel time and is not the best travel path.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Ant Colony Algorithm Applied to Dynamic Path Planning Method in Congested Environment
  • Ant Colony Algorithm Applied to Dynamic Path Planning Method in Congested Environment
  • Ant Colony Algorithm Applied to Dynamic Path Planning Method in Congested Environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0060] An ant colony algorithm provided in this embodiment is used for a dynamic path planning method in a congested environment, including:

[0061] Step 1, carry out environment modeling, obtain the environment factor that represents the congestion situation under the congestion environment;

[0062] Step 2, after replacing the distance of the road in the ant colony algorithm with the environmental factor, the dynamic path planning is carried out by using the dynamic change of the environmental factor.

[0063] That is to say, the present invention mainly includes three parts: environment modeling, ant colony algorithm, and application of ant colony algorithm for dynamic path planning.

[0064] 1. Environment Modeling

[0065] There are n intersections and m roads in the traffic road network, each intersection is abstracted as a point, and the roads connected between the intersections are abstracted as an edge; then each edge has an environmental factor E at time t fi (t);...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an ant colony algorithm used in a dynamic path planning method in a congested environment, comprising: Step 1, performing environment modeling to obtain environmental factors representing the congestion situation in a congested environment; and Step 2, replacing the environmental factors with the ant After the distance of the road in the group algorithm, the dynamic change of environmental factors is used for dynamic path planning. The present invention proposes environmental factors that reflect traffic congestion, uses the method of environmental modeling to obtain environmental factors in a congested environment, and uses the ant colony algorithm for congested environments by replacing the environmental factors with the distance of the road in the ant colony algorithm The dynamic path planning of the algorithm makes up for the fact that the existing path planning algorithms do not consider the dynamic changes of environmental congestion, improves the accuracy of the optimal solution of path planning in the congested environment, and is more in line with the current urban traffic congestion.

Description

technical field [0001] The invention relates to the technical field of traffic, in particular to an ant colony algorithm used in a dynamic path planning method in a congested environment. Background technique [0002] Existing path planning algorithms, in the application of traffic network, generally only quickly find the shortest path between two points in the traffic road network, without considering the impact of the environment on travel. The environment, especially the congested environment, has a great impact on travel. In a congested environment, the shortest path between two points often has the problems of severe congestion, slow moving vehicles, and long waiting time, which seriously delays travel time and is not the best travel path. Now road congestion is a common problem in big cities, and environmental congestion has become a factor that must be considered in path planning. Contents of the invention [0003] The technical problem to be solved by the present ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G05D1/02
CPCG05D1/0221G05D1/0276G05D2201/02
Inventor 吴春江周世杰肖莉才陈鹏飞孙云飞王威罗艺刘睿凡刘高峰
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products