Dynamic Path Bifurcation in the Beckmann Reaction: Support from Kinetic Analyses

2011 ◽  
Vol 76 (11) ◽  
pp. 4652-4660 ◽  
Author(s):  
Yutaro Yamamoto ◽  
Hiroto Hasegawa ◽  
Hiroshi Yamataka
Keyword(s):  
Dynamic Path ◽  
Path Bifurcation

scholarly journals Dynamic path bifurcation for the Beckmann reaction: observation and implication

2010 ◽  
Vol 145 ◽  
pp. 327-340 ◽  
Author(s):  
Hiroshi Yamataka ◽  
Makoto Sato ◽  
Hiroto Hasegawa ◽  
Salai C. Ammal
Keyword(s):  
Dynamic Path ◽  
Path Bifurcation

scholarly journals Global Dynamic Path Planning Fusion Algorithm Combining Jump-A* Algorithm and Dynamic Window Approach

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 19632-19638
Author(s):  
Lisang Liu ◽  
Jinxin Yao ◽  
Dongwei He ◽  
Jian Chen ◽  
Jing Huang ◽  
...  
Keyword(s):  
Path Planning ◽  
A Algorithm ◽  
Fusion Algorithm ◽  
Global Dynamic ◽  
Dynamic Path Planning ◽  
Dynamic Path ◽  
Window Approach

Dynamic Path Planning Algorithm Based on Chaos Genetic Vehicle Navigation

2011 ◽  
Vol 142 ◽  
pp. 12-15
Author(s):  
Ping Feng
Keyword(s):  
Path Planning ◽  
Search Algorithm ◽  
Traffic Condition ◽  
Planning Time ◽  
Dynamic Path Planning ◽  
Short Period ◽  
Planning Algorithm ◽  
Dynamic Path ◽  
Path Planning Algorithm ◽  
Chaos Genetic Algorithm

The paper puts forward the dynamic path planning algorithm based on improving chaos genetic algorithm by using genetic algorithms and chaos search algorithm. In the practice of navigation, the algorithm can compute at the best path to meet the needs of the navigation in such a short period of planning time. Furthermore,this algorithm can replan a optimum path of the rest paths after the traffic condition in the sudden.

Research on pull-type multi-AGV system dynamic path optimization based on time window

2021 ◽  
pp. 095440702098271
Author(s):  
Hongying Shan ◽  
Chuang Wang ◽  
Cungang Zou ◽  
Mengyao Qin
Keyword(s):  
Path Planning ◽  
Time Window ◽  
Planning Problem ◽  
Dijkstra Algorithm ◽  
Before And After ◽  
Common Planning ◽  
Planning Algorithm ◽  
Dynamic Path ◽  
Set Up ◽  
Path Planning Algorithm

This paper is a study of the dynamic path planning problem of the pull-type multiple Automated Guided Vehicle (multi-AGV) complex system. First, based on research status at home and abroad, the conflict types, common planning algorithms, and task scheduling methods of different AGV complex systems are compared and analyzed. After comparing the different algorithms, the Dijkstra algorithm was selected as the path planning algorithm. Secondly, a mathematical model is set up for the shortest path of the total driving path, and a general algorithm for multi-AGV collision-free path planning based on a time window is proposed. After a thorough study of the shortcomings of traditional single-car planning and conflict resolution algorithms, a time window improvement algorithm for the planning path and the solution of the path conflict covariance is established. Experiments on VC++ software showed that the improved algorithm reduces the time of path planning and improves the punctual delivery rate of tasks. Finally, the algorithm is applied to material distribution in the OSIS workshop of a C enterprise company. It can be determined that the method is feasible in the actual production and has a certain application value by the improvement of the data before and after the comparison.

scholarly journals Dynamic Path-decomposed Tries

2020 ◽  
Vol 25 ◽  
pp. 1-28
Author(s):  
Shunsuke Kanda ◽  
Dominik Köppl ◽  
Yasuo Tabei ◽  
Kazuhiro Morita ◽  
Masao Fuketa
Keyword(s):  
Dynamic Path
Sign in / Sign up

Export Citation Format

Share Document