This paper deals with the leader-follower formation control problem while communication constraint in data transmitting is considered. From a practical point of view, we study the case in which unmanned vehicles are subject to the limited sensing, and communication is of a particular interest. A three-dimensional formation flight of multi-unmanned aerial vehicles with leader-follower configurat...

The development of modern air defense missile systems requires robust simulations to adequately place margins on hardware and software design. Coupled with this is the need to accurately model surface reflections that constitute clutter to the missile system. A thorough understanding of these reflections is becoming increasingly important as the air defense threat evolves from large, high-altit...

When a detector sensitive to the target plume IR seeker is used for tracking airborne targets, the seeker tends to follow the target hot point which is a point farther away from the target exhaust and its fuselage. In order to increase the missile effectiveness, it is necessary to modify the guidance law by adding a lead bias command. The resulting guidance is known as target adaptive guidance ...

Radar Seeker is used in missile system for detection and tracking a target. It will be integrated in the nose cone of the missile. During testing and launching of the missile all necessary important parameters and status of the seeker are collected for analysis to ascertain the health of the Seeker. Similarly the configuration and control of the seeker is to ensure the proper mode of operation ...

Seeker optimization algorithm (SOA) is a novel search algorithm based on simulating the act of human searching, which has been shown to be a promising candidate among search algorithms for unconstrained function optimization. In this article we propose a modified seeker optimization algorithm. In order to enhance the performance of SOA, our proposed approach uses two search equations for produc...

x0. Introduction. Consider a game played by 2 players, whom we call the hider and the seeker. Let S be a simplex of dimension n, with vertices x 0 , x 1 ; : : :; x n , and M a subcomplex of S, known to both the hider and the seeker. Let be a simplex of S, known only to the hider. The seeker is permitted to ask questions of the sort \Is vertex x i in ?" The seeker's goal is to determine whether ...

We study a multi-step hider-seeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zero-sum Bayesian game, which can be solved in weakly polynomial time in the players’ action spaces. The seeker’s action space is exponential in c, and both players’ action spaces are exponential in the game horizon. T...

In an innovation contest, a rm (the seeker) facing an innovation related problem (e.g. a technical R&D problem) posts this problem to a population of independent agents (the solvers) and then provides an award to the agent that generated the best solution. In this paper, we analyze the interaction between a seeker and a set of solvers. Prior research in Economics suggests that having many solv...