Loading...
Search for: flocking
0.011 seconds
Total 21 records

    Flocking algorithms in networks with directed switching velocity interaction topologies

    , Article Asian Journal of Control ; Vol. 16, issue. 4 , July , 2014 , p. 1141-1154 Atrianfar, H ; Haeri, M ; Sharif University of Technology
    Abstract
    This paper studies flocking algorithms for multi-agent systems with directed switching velocity interaction topologies. It is assumed that the position information of each agent is available for agents within its neighborhood region of radius r, however, they communicate the velocity information between each other through unidirectional links modeled by a particular class of directed topologies. A new energy function is defined to analyze the global stability and a sufficient condition is derived for asymptotic flocking in the face of switching topologies. The proposed control strategy guarantees the achievement of desired formations, while avoiding collisions among agents. It also ensures... 

    Collective movement and collective information acquisition with signaling

    , Article Frontiers in Physics ; Volume 9 , 2021 ; 2296424X (ISSN) Salahshour, M ; Rouhani, S ; Sharif University of Technology
    Frontiers Media S.A  2021
    Abstract
    We consider a population of mobile agents able to make noisy observations of the environment and communicate their observation by production and comprehension of signals. Individuals try to align their movement direction with their neighbors. Besides, they try to collectively find and travel towards an environmental direction. We show that, when the fraction of informed individuals is small, by increasing the noise in communication, similarly to the Vicsek model, the model shows a discontinuous order-disorder transition with strong finite-size effects. In contrast, for a large fraction of informed individuals, it is possible to go from the ordered phase to the disordered phase without... 

    A sampled-data algorithm for flocking of multi-Agent systems

    , Article 7th Conference on Artificial Intelligence and Robotics, IRANOPEN 2017, 9 April 2017 ; 2017 , Pages 147-152 ; 9781538628621 (ISBN) Yazdani, S ; Haeri, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    This paper investigates a new algorithm for flocking of multi-Agent systems with virtual leader. In this algorithm, unlike the existing algorithms, receiving of information by agents are not continuous and it is assumed that each agents receives information of neighbors and virtual leader as sampled data in fixed time intervals. A sufficient condition on sampling period is derived to guarantee the velocity convergence of agents to that of virtual leader, preserve network connectivity, and ensure collision avoidance. Finally, a numerical simulation is provided to illustrate the theoretical results. © 2017 IEEE  

    Development of a Distributed Algorithm for Flocking of Non-Holonomic Aerial Agents

    , M.Sc. Thesis Sharif University of Technology Soleymani, Touraj (Author) ; Saghafi, Fariborz (Supervisor)
    Abstract
    The goal of this project is the development of a control algorithm for a flock of non-holonomic aerial agents. For this purpose,the swarm architecture having some unique features such as robustness, flexibility, and scalability is utilized. Swarm is defined as a group of simple agents having local interactions between themselves and the environmentwhich shows an unpredictable emergent behavior.Behavior based control which is inspired from the animal behaviors is employed to control the swarm of mobile agents. Accordingly, the necessary behaviors which are distance adjustment, velocity agreement, and virtual leader tracking together with a fuzzy coordinator are designed. In this study, in... 

    Theoretical analysis of flocking algorithms in networks of second order dynamic agents with switching topologies

    , Article Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME ; Vol. 136, Issue 1 , 2014 ; ISSN: 00220434 Atrianfar, H ; Haeri, M ; Sharif University of Technology
    Abstract
    This paper deals with a refined analysis and modification of existing results on the flocking algorithms proposed for the second order dynamic agents. In the present work, the limiting condition of ever connectivity is removed and it is proved that the flocking can be reached if only the union of the network proximity graphs during nonoverlapping time intervals becomes connected frequently enough. Also, it is proved that including a static virtual leader cannot model the group objective of achieving the desired velocity and it will stop eventually at a predefined point in the space. The convergence rate to this fixed point is determined too. The last contribution of this paper is definition... 

    On the number of informed agents and their initial positions in a free flocking

    , Article Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME ; Volume 135, Issue 5 , 2013 ; 00220434 (ISSN) Paygani, A. R ; Haeri, M ; Sharif University of Technology
    2013
    Abstract
    In a multi-agent system, the number and initial position of informed agents play a major role in the convergence of uninformed agents. In this paper, three different patterns of informed agents' initial positions are studied to see how the convergence percentage can be affected by the number of informed agents. The proposed initial locations are intuitive and inferred from the collective behavior in humans. To evaluate efficiency of the proposed methods and to compare them from different points of view, large number of computer simulations is performed and results are analyzed  

    On properties of a particular class of directed graphs used in stability analysis of flocking algorithms

    , Article Proceedings of the IEEE International Conference on Control Applications, 3 October 2012 through 5 October 2012 ; 2012 , Pages 605-608 ; 1085-1992 (ISSN) ; 9781467345033 (ISBN) Atrianfar, H ; Haeri, M ; Sharif University of Technology
    2012
    Abstract
    In this paper, we present sufficient conditions to address a larger class of digraphs, including balanced ones, whose members' Laplacian (L) makes L 1L + LTL1 to be positive semi-definite, where L1 is the Laplacian associated with a fully connected equally-edged weighted graphs. This property can be later utilized to introduce an appropriate energy function for stability analysis of flocking algorithms in a larger class of networks with switching directed information flow. Also, some of their properties are investigated in the line of matrix theory and graph theory  

    Optimization on Initial Position and Number of Informed Agents in a Flocking in Presence of Obstacles

    , M.Sc. Thesis Sharif University of Technology Paygani, Alireza (Author) ; Haeri, Mohammad (Supervisor)
    Abstract
    dFlocking in multi-agent systems as one of the most interested phenomena has gained scientists and researchers attention in recent years. In a multi-agent system, agents by using a consensus algorithm, which designed based on collective, collision avoidance, and velocity adaption rules, try to catch a common goal together. The aims which may define for flocking of a multi-agent system include the getting a certain point, chasing an alien agent, moving in a given route, and so on. Without considering flock’s purposes, all agents must be aware about the goal to catch it. But it is not possible always to inform all agents about the goal. Because sending the goal information to all agents due to... 

    Environment Identification by Experimental Swarm Agents

    , M.Sc. Thesis Sharif University of Technology Navvabi, Hamed (Author) ; Alasty, Aria (Supervisor)
    Abstract
    Swarm is coordinated group action that usually done with little communication among its members. Using several simple members instead of the complicated ones reduces cost, simplifies system and increases the reliability. On the other hand, the mission can be done faster. This thesis is done in two general sections; theoretical and experimental parts. At first some important missions are simulated in MATLAB/Simulink such as aggregation, dispersion, flocking, obstacle detection, obstacle collision avoidance and orbiting around the obstacle. Orbiting around the obstacle is simulated formation flying and a constellation of satellites (such as GPS systems). The methodology is artificial potential... 

    Flocking of multi-agent dynamic systems with virtual leader having the reduced number of informed agents

    , Article Transactions of the Institute of Measurement and Control ; Volume 35, Issue 8 , 2013 , Pages 1104-1115 ; 01423312 (ISSN) Atrianfar, H ; Haeri, M ; Sharif University of Technology
    2013
    Abstract
    In this paper, three fundamental properties of a potential field-based flocking algorithm, i.e. merging of neighbouring graphs during the system evolution, collision avoidance and convergence of position of the centre of mass of informed agents to that of virtual leader are discussed. Next, these properties are utilized to determine required number of informed agents based on initial position of uninformed ones and consequently reduce the domain of search in optimization problems defined for finding the optimal number of required informed agents. Finally, a new optimization framework is proposed, which benefits Voronoi diagrams in order to reduce the number of informed agents required for... 

    On exponential flocking to the virtual leader in network of agents with double-integrator dynamics

    , Article Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME ; Volume 135, Issue 3 , 2013 ; 00220434 (ISSN) Jahromi, H. T ; Haeri, M ; Sharif University of Technology
    2013
    Abstract
    This paper considers flocking to the virtual leader in network of agents with double-integrator. A locally linear algorithm is employed which guarantees exponential flocking to the virtual leader. A lower bound for flocking rate is calculated which is independent of the initial conditions. Simulations are provided to validate the result and it is shown that the calculated rate is not over bound the actual convergence rate. The effect of coefficients of algorithm is investigated and it is shown that the similar results can be inferred from the calculated formula for the convergence rate. Copyright  

    Collision avoidance with obstacles in flocking for multi agent systems

    , Article ; 2010 International Conference on Industrial Electronics, Control and Robotics, Rourkela, 27 December 2010 through 29 December 2010 , 2010 , Pages 1-5 ; 9781424485468 (ISBN) Rahimi Mousavi, M. S ; Khaghani, M ; Vossoughi, G ; Sharif University of Technology
    Abstract
    Multi agent system is a system consist of multiple interacting agents. These systems tend to select the best solution for their problems. They can be used in different tasks which are hard for an individual or even a complex system to do. One of the most common algorithms which are used in multi agent systems is flocking. Here we introduce a theorem that multi agent systems could flock in environments with fixed obstacles without any collision between agents and obstacles. We use lyapunov theory and prior algorithms on flocking to extract a theorem which under those conditions in the theorem, collision never occurs between agents and obstacles. Results show that the theorem insures collision... 

    Swarm Robotic: an Experimental Investigation

    , M.Sc. Thesis Sharif University of Technology Nemati Estahbanati, Alireza (Author) ; Meghdari, Ali (Supervisor)
    Abstract
    Nowadays, World is witnessing an epidemic increase in Robotic Concepts and its usage in diverse fields such as Explore and Rescue Missions, Conservation and Guarding of Environments and various Millenarian Applications. While, different Goals like increasing the precision and speed of missions performance, and decreasing the costs have been always the major priorities in design and building robots. One of the best methodologies to achieve aforementioned goals is to replace a highly capable robot with a group of simple and restricted robots. This suggestion is inspired by the nature and lots of its animals, like birds, fishes and insects. These creatures use socializing in order to forage and... 

    Stable and Connected Coordination of Robotic Swarms Through Local Information

    , Ph.D. Dissertation Sharif University of Technology Etemadi Haghighi, Shahram (Author) ; Alasty, Aria (Supervisor) ; Vossoughi, Gholamreza (Supervisor)
    Abstract
    In this thesis, coordination of a group of autonomous agents, through a scalable control structure and with very limited communications, is addressed. Inter-agent action functions are designed to guarantee the network connectivity. Two coordinator agents with different natures are designed. One is attractive and is named leader-agent (LA). The other is repulsive and is named shepherd-agent (SA). Under the assumption that both coordinators locally affect the group, we have proved that the governing equation of the whole group may have variable order.
    By using nonlinear control techniques, coordination algorithms are designed to move the group on a predefined path or to a destination. It... 

    Collective dynamics of interacting particles in unsteady flows

    , Article SIAM Journal on Applied Dynamical Systems ; Vol. 13, Issue. 1 , 2014 , pp. 194-209 ; ISSN: 15360040 Abedi, M ; Jalali, M. A ; Sharif University of Technology
    Abstract
    We use the Fokker-Planck equation and its moment equations to study the collective behavior of interacting particles in unsteady one-dimensional flows. Particles interact according to a longrange attractive and a short-range repulsive potential field known as Morse potential. We assume Stokesian drag force between particles and their carrier fluid and find analytic single-peaked traveling solutions for the spatial density of particles in the catastrophic phase. In steady flow conditions the streaming velocity of particles is identical to their carrier fluid, but we show that particle streaming is asynchronous with an unsteady carrier fluid. Using linear perturbation analysis, the stability... 

    Adaptive flocking control of nonlinear multi-agent systems with directed switching topologies and saturation constraints

    , Article Journal of the Franklin Institute ; Volume 350, Issue 6 , August , 2013 , Pages 1545-1561 ; 00160032 (ISSN) Atrianfar, H ; Haeri, M ; Sharif University of Technology
    2013
    Abstract
    In this paper, we propose and analyze flocking algorithms in a network of second-order agents with bounded control inputs and nonlinear intrinsic dynamics. We consider a general switching network topology, for velocity information exchange, rather than undirected or fixed directed network topology with a directed spanning tree. The proposed adaptive controller architecture applies a leader-following strategy in which the pinning scheme is defined based on the interaction topology. Finally, some examples are presented to illustrate the theoretical results  

    Robust adaptive fault-tolerant control for leader-follower flocking of uncertain multi-agent systems with actuator failure

    , Article ISA Transactions ; Volume 71 , 2017 , Pages 227-234 ; 00190578 (ISSN) Yazdani, S ; Haeri, M ; Sharif University of Technology
    Abstract
    In this work, we study the flocking problem of multi-agent systems with uncertain dynamics subject to actuator failure and external disturbances. By considering some standard assumptions, we propose a robust adaptive fault tolerant protocol for compensating of the actuator bias fault, the partial loss of actuator effectiveness fault, the model uncertainties, and external disturbances. Under the designed protocol, velocity convergence of agents to that of virtual leader is guaranteed while the connectivity preservation of network and collision avoidance among agents are ensured as well. © 2017 ISA  

    Analysis and Synthesis of Distributed Consensus-Based Controllers in Cooperative Systems

    , Ph.D. Dissertation Sharif University of Technology Atrianfar, Hajar (Author) ; Haeri, Mohammad (Supervisor)
    Abstract
    Cooperative control of autonomous multi-agent systems is one of the challenging problems in control theory. According to existing enhancements in communication networks and broad application of multi-agent systems in various engineering fields, coordinated motion control in multi-agent systems has been attracted the attention of researchers in control science. In this thesis, flocking algorithms in multi-agent systems with undirected interactions (bidirectional information flow) is considered and new convergence results and final characteristics are obtained. Also, geometric optimization methods are used to propose a new optimization problem to reduce the number of informed agents of the... 

    Utility of Cooperative Parafoils for Recovery of Multi-Segmented Launch Systems

    , M.Sc. Thesis Sharif University of Technology Namdari, Hassan (Author) ; Fathi Jegarkandi, Mohsen (Supervisor)
    Abstract
    Today, a lot of efforts have been done in order to commercialize space travels. Spacecrafts have a lot of components and producing each of them spends high costs. Components such as propellant tanks and boosters are multi segment and are released simultaneously and therefore it is economically feasible to recover them. Due to Parafoil ability in low-cost, soft (no damage to the cargo) and accurate landing, it is gradually replacing parachute. Parafoil can fly long distances after being released, so its landing point could be determined. The aim of the study is to evaluate this scenario in which some segments of launch vehicle (e.g. booster) that are equipped with Parafoil expand their... 

    Active leading through obstacles using ant-colony algorithm

    , Article Neurocomputing ; Volume 88 , 2012 , Pages 67-77 ; 09252312 (ISSN) Vatankhah, R ; Etemadi, S ; Alasty, A ; Vossoughi, G. R ; Boroushaki, M ; Sharif University of Technology
    Abstract
    In presence of obstacles, inter-agent pulling actions must be bounded. In this case, to remain connected to the group, the leader-agent (LA) must perform an active leading strategy. In this paper, an active leading algorithm is proposed which monitors the neighborhood of the LA and adjusts its velocity. The algorithm is based on the ant colony optimization (ACO) technique. As a real time optimization package, the ACO algorithm maximizes influence of the LA on the group, leading to fast flocking. Comparison with another optimization method is provided as well. Simulations show that the algorithm is successful and cost effective