Description: 结合人工势场法,提出一种新的极限环方法. 它可以在诸如机器人足球赛等动态变化的环境中为自主
移动机器人进行很好的实时路径规划. 将障碍物的运动速度和一些不易直接表达的策略①等转化成势场,然后把势
场抽象成虚拟的障碍物,通过改变非线性方程的极限环半径,获得动态运动路径规划. 这种方法能让机器人对高速
运动的障碍物有很平滑的避障能力,并且能综合复杂的路径规划要求达到目标. 仿真和试验都表明了这种方法在机
器人足球赛中的应用价值.-In this paper , an improved limit2cycle navigation method integrated with the potential field approach is proposed.
Firstly , the complex navigation requirements , such as movement strategy and speed estimation appearing in the robot soccer , are
transformed into virtual obstacles by analysis of the potential field. Then , the limit2cycle navigation is applied to themfor a dynamic
route planning by adjusting the radius of the limit2cycle. The route planning method enables a robot to avoid high2speed moving ob2
stacles smoothly and reach desired destination with complex requirements. The effectiveness of the proposed method is proved by
simulations and experiments in the robot soccer competition. Platform: |
Size: 372736 |
Author:陈卿 |
Hits:
Description: 蚁群算法最短路径通用Matlab程序蚁群算法动态寻路算法-Shortest path algorithm for general ant colony algorithm Matlab program Dynamic Algorithm for Route Platform: |
Size: 2048 |
Author:kevin |
Hits:
Description: 仅考虑公汽线路，给出任意两公汽站点之间线路选择问题的一般数学模型与算法。并根据附录数据，利用你们的模型与算法，求出以下6对起始站→终到站之间的最佳路线。利用最优化原理，建立出一个动态规划模型，并运用广度优先的算法，在模型和算法的基础上，通过迭代的思想，实现用基于选取换乘K-1次路线的方法得到换乘K次的路线-Consider only the bus line, given a choice between any two lines for the bus station issue general mathematical model and algorithms. And in accordance with Appendix data, use your model and algorithm obtains the following six pairs starting station → best route between the final station. The use of optimization theory, establish a dynamic programming model, and use breadth-first algorithm, based on models and algorithms, iterative thinking, implemented by K-1 based on the selected sub-route transfer method to get the transfer K times route
Platform: |
Size: 1901568 |
Author:water |
Hits:
Search - dynamic route optimization