Swarm Automated Planning Algorithm with Repairing Operators

Xiao Long Chai

doi:10.4028/www.scientific.net/AMM.333-335.1426

Paper Titles

Hierarchical Clustering Algorithm of the Minimum Risk
p.1410

An Improved Heuristic Algorithm for a Hybrid Flow-Shop Scheduling
p.1414

A Modified Fuzzy C-Mean Algorithm for Automatic Clustering Number
p.1418

Using Hybrid Fuzzy Neural Network to Improve the Accuracy of Air Traffic Flow Forecasts
p.1422

Swarm Automated Planning Algorithm with Repairing Operators
p.1426

Reseach on Feature Selection Algorithm Based on the Margin of Support Vector Machine
p.1430

A Fast and Robust Adaptive Blind Equalization Algorithm in High Speed Satellite Channel
p.1435

A Solution to Best Itinerary Problem Based on Strategy Set under Dijkstra Algorithm
p.1442

Automatic Well Selection Method for Acid-Fracturing in Kazakhstan R Oilfield Carbonate Reservoir
p.1446

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 333-335Swarm Automated Planning Algorithm with Repairing...

Swarm Automated Planning Algorithm with Repairing Operators

Abstract:

Swarm automated planning algorithm is a planning method based on planning graph technology, and the algorithm which could improve the searching efficiency through importing swarm intelligence has the character of global and parallel. Yet sometimes the algorithm has the shortcoming in the local searching. For instance, maybe the quality of the best candidate planning solution would get lower after another around of searching. To enhance the ability of the local searching and the convergence acceleration, the swarm automated planning algorithm which with the local repairing operators is presented in this paper. The searching efficiency could be bettered through the pertinence repairing operators and the heuristic evaluation information to control the repairing processes.

You might also be interested in these eBooks

Measurement Technology and Engineering Researches in Industry

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 333-335)

Pages:

1426-1429

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.333-335.1426

Citation:

Cite this paper

Online since:

July 2013

Authors:

Xiao Long Chai

Keywords:

Ant Colony Planning Algorithm, Heuristic Tactics, Intelligence Planning, Temporal Constraints, Working Procedures Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] ZENG Bi, YANG Yimin. Method of real_time path planning based on ant colony algorithm in dynamic environment. Application Research of Computers. 2010, 27(3): 860-863.

Google Scholar

[2] JIN Feihu, GUO Qi. Research of multi-space station path planning using Hopfield neural network based on ant colony system. Application Research of Computers. 2010, 27(1): 860-863.

Google Scholar

[3] Serap Ulusam Sec_kiner, Mustafa Kurt. Ant colony optimization for the job rotation scheduling problem[J]. Applied Mathematics and Computation. 2008, 201(1-2): 149-160.

DOI: 10.1016/j.amc.2007.12.006

Google Scholar

[4] Kwee Kim Lim, Yew-Soon Ong, Meng Hiot Lim, etc. Hybrid ant colony algorithms for path planning in sparse graphs[J]. Soft Computing. 2008, 12(10): 981–994.

DOI: 10.1007/s00500-007-0264-x

Google Scholar

[5] CHAI Xiaolong etc. Ant colony planning algorithm based on planning graph. Journal of Computer Research and Development. 2009, 46(9): 1471-1479.

Google Scholar