Veysel Gazi

Bio: Veysel Gazi is an academic researcher from Istanbul Kemerburgaz University. The author has contributed to research in topics: Swarm behaviour & Sliding mode control. The author has an hindex of 26, co-authored 82 publications receiving 4444 citations. Previous affiliations of Veysel Gazi include Ohio State University & Atılım University.

Stability analysis of swarms

Abstract: In this note, we specify an "individual-based" continuous-time model for swarm aggregation in n-dimensional space and study its stability properties. We show that the individuals (autonomous agents or biological creatures) will form a cohesive swarm in a finite time. Moreover, we obtain an explicit bound on the swarm size, which depends only on the parameters of the swarm model.

Stability analysis of social foraging swarms

Abstract: In this article we specify an M-member "individual-based" continuous time swarm model with individuals that move in an n-dimensional space according to an attractant/repellent or a nutrient profile. The motion of each individual is determined by three factors: i) attraction to the other individuals on long distances; ii) repulsion from the other individuals on short distances; and iii) attraction to the more favorable regions (or repulsion from the unfavorable regions) of the attractant/repellent profile. The emergent behavior of the swarm motion is the result of a balance between inter-individual interactions and the simultaneous interactions of the swarm members with their environment. We study the stability properties of the collective behavior of the swarm for different profiles and provide conditions for collective convergence to more favorable regions of the profile.

Stability analysis of swarms

Abstract: We specify an "individual-based" continuous time model for swarm aggregation in n-dimensional space and study its stability properties. We show that the individuals (autonomous agents or biological creatures) will form a cohesive swarm in a finite time. Moreover, we obtain an explicit bound on the swarm size, which depends only on the parameters of the swarm model.

Swarm aggregations using artificial potentials and sliding-mode control

Abstract: In this paper, we consider a control strategy of multiagent systems, or simply, swarms, based on artificial potential functions and the sliding-mode control technique. First, we briefly discuss a "kinematic" swarm model in n-dimensional space introduced in an earlier paper. In that model, the interindividual interactions are based on artificial potential functions, and the motion of the individuals is along the negative gradient of the combined potential. After that, we consider a general model for vehicle dynamics of each agent (swarm member), and use sliding-mode control theory to force their motion to obey the dynamics of the kinematic model. In this context, the results for the initial model serve as a "proof of concept" for multiagent coordination and control (swarm aggregation), whereas the present results serve as a possible implementation method for engineering swarms with given vehicle dynamics. The presented control scheme is robust with respect to disturbances and system uncertainties.

A class of attractions/repulsion functions for stable swarm aggregations

Abstract: In this brief article, we consider an M-member `individual-based' continuous time swarm model in an n-dimensional space and extend the results in Gazi and Passino (2003) by specifying a general class of attraction/repulsion functions that can be used to achieve swarm aggregation. These functions are odd functions that have terms for attraction and repulsion acting in opposite directions in compliance with real biological swarms. We present stability analysis for several cases of the functions considered to characterize swarm cohesiveness, size and ultimate motions while in a cohesive group. Moreover, we show how the model can be extended for achieving formation control. Furthermore, we discuss how the attraction repulsion functions can be modified to incorporate the finite body size of the swarm members. Numerical simulations are also presented for illustration purposes.

Consensus problems in networks of agents with switching topology and time-delays

Abstract: In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.

Cuckoo Search via Lévy flights

Abstract: In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Levy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research.

Flocking for multi-agent dynamic systems: algorithms and theory

Abstract: In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in free-space and presence of multiple obstacles are considered. We present three flocking algorithms: two for free-flocking and one for constrained flocking. A comprehensive analysis of the first two algorithms is provided. We demonstrate the first algorithm embodies all three rules of Reynolds. This is a formal approach to extraction of interaction rules that lead to the emergence of collective behavior. We show that the first algorithm generically leads to regular fragmentation, whereas the second and third algorithms both lead to flocking. A systematic method is provided for construction of cost functions (or collective potentials) for flocking. These collective potentials penalize deviation from a class of lattice-shape objects called /spl alpha/-lattices. We use a multi-species framework for construction of collective potentials that consist of flock-members, or /spl alpha/-agents, and virtual agents associated with /spl alpha/-agents called /spl beta/- and /spl gamma/-agents. We show that migration of flocks can be performed using a peer-to-peer network of agents, i.e., "flocks need no leaders." A "universal" definition of flocking for particle systems with similarities to Lyapunov stability is given. Several simulation results are provided that demonstrate performing 2-D and 3-D flocking, split/rejoin maneuver, and squeezing maneuver for hundreds of agents using the proposed algorithms.

Computer vision : a modern approach = 计算机视觉 : 一种现代的方法

Abstract: From the Publisher: The accessible presentation of this book gives both a general view of the entire computer vision enterprise and also offers sufficient detail to be able to build useful applications. Users learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. A CD-ROM with every copy of the text contains source code for programming practice, color images, and illustrative movies. Comprehensive and up-to-date, this book includes essential topics that either reflect practical significance or are of theoretical importance. Topics are discussed in substantial and increasing depth. Application surveys describe numerous important application areas such as image based rendering and digital libraries. Many important algorithms broken down and illustrated in pseudo code. Appropriate for use by engineers as a comprehensive reference to the computer vision enterprise.