Cooperative Target Observation Moving Over a Planar Graph using a Modified Hill Climbing Search
نویسندگان
چکیده
منابع مشابه
Convergence of a Hill Climbing Genetic Algorithm for Graph Matching
This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorporated a hill-climbing step. In the present study we return to the algorithm and provide some the...
متن کاملCooperative Surveillance of a Moving Target Using a Formation Framework
In this paper we address the formation control problem of generating a formation for a group of nonholonomic mobile agents. The formation control scheme which is proposed in this paper is based on a fusion of leader-follower and the virtual referenced approaches. This scheme gives a formation error representation that is independent of the number of agents in the formation and the resulting con...
متن کاملConstructing Binary Descriptors with a Stochastic Hill Climbing Search
Binary descriptors of image patches provide processing speed advantages and require less storage than methods that encode the patch appearance with a vector of real numbers. We provide evidence that, despite its simplicity, a stochastic hill climbing descriptor construction process defeats recently proposed alternatives on a standard discriminative power benchmark. The method is easy to impleme...
متن کاملImproving Surveillance Using Cooperative Target Observation
The Cooperative Target Observation (CTO) problem has been of great interest in the multi-agents and robotics literature due to the problem being at the core of a number of applications including surveillance. In CTO problem, the observer agents attempt to maximize the collective time during which each moving target is being observed by at least one observer in the area of interest. However, mos...
متن کاملBoolean Function Design Using Hill Climbing Methods
This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2020
ISSN: 0975-8887
DOI: 10.5120/ijca2020920134