350 rub
Journal Information-measuring and Control Systems №10 for 2016 г.
Article in number:
The modification method and iterative deepening algorithm for the work of the route planning of the cell matrix
Authors:
V.O. Avdeev - Head of Division, Southwest State University (Kursk) A.G. Kurochkin - Post-graduate Student, Department of Information Systems and Technologies, Southwest State University (Kursk) P.V. Lotorev - Post-graduate Student, Department of Information Systems and Technologies, Southwest State University (Kursk) E.A. Titenko - Ch.D. (Eng.), Associate Professor, Department of Information Systems and Technologies, Southwest State University (Kursk) E-mail: johntit@mail.ru
Abstract:
The object of study is the graph representation of the terrain for the robot motion. The aim is the synthesis method and iterative deepening algorithm for directed search down and to the right on the graph without loss of search time. The graph is based on a matrix of cells on the digital map. Each cell array has a local neighborhood. This means that each state has a 8 or 16 branches and similarities. The graph contains are many paths, with multiple occurrences in the previously reviewed fragments of the graph. The possibilities and limitations of complete and heuristic search algorithms in a strongly connected graph. Practical interest is represented search algorithms, performing selective (directed) selection of states and their respective branches of the graph. Among the complete search algorithm with an iterative algorithm is considered recessed. It has a possibility of a perfect choice of all alternatives and possible the choice of priority alternatives. The iterative deepening algorithm exercises alternately an XY scan state graph. This compensates for excessive time losses on the search. The modification of the method and algorithm consists in adding two levels of penetration deepening and the return whose values increase in the search process. These values increase during search. Research methods: system analysis, theory of the algorithms, a decision support theory
Pages: 46-50
References

 

  1. Lotorev P.V., Kurochkin A.G., Grivachev A.V., Emeljanov S.G. Organizacija sistemy podderzhki prinjatija reshenijj dlja upravlenija gruppojj robotov // Izvestija JUgo-Zapadnogo gosudarstvennogo universiteta. Ser. Upravlenie, vychisli­telnaja tekhnika, informatika. Medicinskoe priborostroenie. 2015. № 3(16). S. 30-36.
  2. Titenko E.A., Tutov E.B. Modificirovannyjj algoritm poiska s iteracionnym zaglubleniem na grafovykh strukturakh // Izvestija JUgo-Zapadnogo gosudarstvennogo universiteta. 2011. № 3(36). S. 82-90.
  3. Titenko E.A., Petrik E.A., Atakishhev O.I., Voronin D.A. Produkcionnaja model dlja parallelnojj obrabotki znanijj // Informacionno-izmeritelnye i upravljajushhie sistemy. 2011. № 11. T. 9. S. 81-86.
  4. Ljuger Dzh.F. Iskusstvennyjj intellekt: strategii i metody reshenija slozhnykh problem. M.: Izd. Dom «Viljams». 2003. 864 s.
  5. Titenko E.A. i dr. Modificirovannaja produkcionnaja sistema dlja reshenija zadachi strukturnogo raspoznavanija obrazov // Izvestija JUgo-Zapadnogo gosudarstvennogo universiteta. Ser. Upravlenie, vychislitelnaja tekhnika, informatika. Medicinskoe priborostroenie. 2011. № 2. S. 45-50.