排序方式: 共有232条查询结果,搜索用时 46 毫秒
171.
ad-hoc网络具有自组性强、快速组网和高抗毁等特性,以它组网的多机器人编队适用于一些无法预先安装通信设备的特殊场合。但是由于ad-hoc网络的通信覆盖范围有限、网络动态性强,在进行编队控制时如果不考虑编队中机器人之间的通信距离,可能导致机器人因与网络失去联系而脱离编队。为了确保多机器人编队的完整性,在使用势场法进行编队控制时,除考虑目标和障碍物的影响外,同时将机器人之间的通信距离作为一种引力加入传统的环境势场模型。仿真实验的结果证明该方法可以有效地控制ad-hoc方式组网的机器人编队。 相似文献
172.
173.
174.
Steve Alpern 《海军后勤学研究》2002,49(3):256-274
Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011 相似文献
175.
针对量化和通信时延约束下多Lagrange航行体的集结问题进行了研究,提出了一种与模型相关的右边不连续控制算法,设计了一个均匀量化器,并运用图论、矩阵理论以及实用稳定性理论,验证控制器的稳定性。研究结果表明:多航行体可以在量化和通信时延影响的无向通信图下,实现有误差界的集结。基于MATLAB软件进行的数值仿真实验,证明了算法的有效性。 相似文献
176.
由于时延和测量、控制偏差的影响,环月轨道遥操作交会对接最终平移段的轨道控制面临诸多问题。针对这些问题,对遥操作交会对接共享控制策略进行研究。运用相对轨道动力学方程构造遥操作交会对接的数学模型,在此基础上推导时延条件下的预显示模型。在考虑可控边界的条件下构造对接安全走廊,提出基于改进人工势场的自控方法,势场函数将航天器与安全走廊的相对距离和逼近速度作为参考量。结合操纵人员的手动控制操作特性,推导共享控制的权重系数,形成共享控制策略。在九自由度遥操作交会对接半实物仿真平台开展仿真试验。仿真结果表明:相比于采用自动控制和手动控制方式而言,共享控制方式能有效克服时延的影响,显著提高环月轨道交会任务对接精度和成功率,改善环月轨道遥操作交会对接控制性能。 相似文献
177.
研究了常值海流作用下自主水下航行器(Autonomous Underwater Vehicle,AUV)的编队控制问题.控制器设计分为两部分:一部分综合应用Lyapunov方法和Backstepping技术设计了单体AUV路径跟踪动力学控制律,保证了路径跟踪误差在常值海流作用下的全局渐进稳定;另一部分为路径参数一致性协同跟踪控制器,保证在仅有一个或一部分AUV获取虚拟领航AUV路径参数更新速度情形下能对其进行协同跟踪.从理论上证明了整个闭环系统的稳定性.仿真结果表明了所提出方法的有效性. 相似文献
178.
This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!23 = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 244–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10005 相似文献
179.
180.