基于多叉树Pareto最优解集的火灾扑救路径规划  

Path Planning of Fire Suppression Based on Multiple Binary Tree Pareto Optimal Solution Set

作　　者：汪华兵 

机构地区：[1]江西省大余县公安消防大队,江西赣州341500

出　　处：《科技通报》2015年第2期209-211,共3页Bulletin of Science and Technology

摘　　要：提出一种基于多叉树Pareto最优解集的火灾扑救路径规划算法,对火灾现场的环境地图和火灾演化态势进行重构,实现对路径的优选,采用Pareto最优解集,构建基于多叉树Pareto最优解集的火源动态发展态势下的火灾扑救路径规划模型。实验结果表明,该模型能快速实现对火源热点的识别,并且规划路径能有效规避复杂建筑障碍物的干扰,实现对火灾扑救路径的最优选择。在动态未知环境中,对火灾扑救路径的规划和选择能达到最优,路径最短,分段较少,能有效地避免复杂建筑物的阻挡,有效节省了火灾扑救时间。A path planning algorithm of fire suppression is proposed based on multiple binary tree Pareto optimal solution set, the fire scene environment map and fire evolvement trend is reconstructed, realize the optimization of path, using the Pareto optimal solution set, the construction of fire fighting path planning model of dynamic development trend of multi tree Pareto optimal solution set based on the fire. The experimental results show that, the model can quickly achieve the recognition of fire hot, and it can effectively avoid the interference of path planning in complex building of obstacles, to achieve the optimal path selection for fire fighting. In dynamic unknown environment, the fire fighting path planning and selection can achieve the optimal segmentation, shortest path is obtained, it can effectively avoid the stop complex building, effectively save the fire fighting time.

关 键 词：火灾扑救 多叉树 PARETO最优解 路径规划 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]