稀疏图中路径规划的蚁群算法

2007 International Conference on Intelligent and Advanced Systems Pub Date : 2007-11-01 DOI:10.1109/ICIAS.2007.4658343

X.S. Chen, M. Lim, Y.S. Ong

{"title":"稀疏图中路径规划的蚁群算法","authors":"X.S. Chen, M. Lim, Y.S. Ong","doi":"10.1109/ICIAS.2007.4658343","DOIUrl":null,"url":null,"abstract":"The general problem of path planning can be modeled as a travelling salesman problem which assumes a graph is fully connected. Full connectivity is however not realistic in many practical path planning problems. The graphs are typically sparse graphs such as for Unmanned Reconnaissance Aerial Vehicles (URAV). This paper describes an Ant Colony System algorithm proposed for path planning in sparse graphs.","PeriodicalId":228083,"journal":{"name":"2007 International Conference on Intelligent and Advanced Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Ant Colony System algorithm for path planning in sparse graphs\",\"authors\":\"X.S. Chen, M. Lim, Y.S. Ong\",\"doi\":\"10.1109/ICIAS.2007.4658343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The general problem of path planning can be modeled as a travelling salesman problem which assumes a graph is fully connected. Full connectivity is however not realistic in many practical path planning problems. The graphs are typically sparse graphs such as for Unmanned Reconnaissance Aerial Vehicles (URAV). This paper describes an Ant Colony System algorithm proposed for path planning in sparse graphs.\",\"PeriodicalId\":228083,\"journal\":{\"name\":\"2007 International Conference on Intelligent and Advanced Systems\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Intelligent and Advanced Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAS.2007.4658343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Intelligent and Advanced Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAS.2007.4658343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

一般的路径规划问题可以建模为一个假设图是完全连通的旅行商问题。然而，在许多实际的路径规划问题中，完全连通是不现实的。图是典型的稀疏图，如无人侦察机(URAV)。本文提出了一种用于稀疏图路径规划的蚁群算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Ant Colony System algorithm for path planning in sparse graphs

The general problem of path planning can be modeled as a travelling salesman problem which assumes a graph is fully connected. Full connectivity is however not realistic in many practical path planning problems. The graphs are typically sparse graphs such as for Unmanned Reconnaissance Aerial Vehicles (URAV). This paper describes an Ant Colony System algorithm proposed for path planning in sparse graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Intelligent and Advanced Systems

自引率

0.00%

发文量