127 research outputs found
Synchronous intercept strategies for a robotic defense-intrusion game with two defenders
We study the defense-intrusion game, in which a single attacker robot tries to reach a stationary target that is protected by two defender robots. We focus on the "synchronous intercept problem", where both robots have to reach the attacker robot synchronously to intercept it. Assume that the attacker robot has the control policy which is based on attraction to the target and repulsion from the defenders, two kinds of synchronous intercept strategies are proposed for the defense-intrusion game, introduced here as Attacker-oriented and Neutral-position-oriented. Theoretical analysis and simulation results show that: (1) the two strategies are able to generate different synchronous intercept patterns: contact intercept pattern and stable non-contact intercept pattern, respectively. (2) The contact intercept pattern allows the defender robots to intercept the attacker robot in finite time, while the stable non-contact intercept pattern generates a periodic attractor that prevents the attack robot from reaching the target for infinite time. There is potential to apply the insights obtained into defense-intrusion in real systems, including aircraft escort and the defense of military targets or territorial boundaries
On the role and opportunities in teamwork design for advanced multi-robot search systems
Intelligent robotic systems are becoming ever more present in our lives across a multitude of domains such as industry, transportation, agriculture, security, healthcare and even education. Such systems enable humans to focus on the interesting and sophisticated tasks while robots accomplish tasks that are either too tedious, routine or potentially dangerous for humans to do. Recent advances in perception technologies and accompanying hardware, mainly attributed to rapid advancements in the deep-learning ecosystem, enable the deployment of robotic systems equipped with onboard sensors as well as the computational power to perform autonomous reasoning and decision making online. While there has been significant progress in expanding the capabilities of single and multi-robot systems during the last decades across a multitude of domains and applications, there are still many promising areas for research that can advance the state of cooperative searching systems that employ multiple robots. In this article, several prospective avenues of research in teamwork cooperation with considerable potential for advancement of multi-robot search systems will be visited and discussed. In previous works we have shown that multi-agent search tasks can greatly benefit from intelligent cooperation between team members and can achieve performance close to the theoretical optimum. The techniques applied can be used in a variety of domains including planning against adversarial opponents, control of forest fires and coordinating search-and-rescue missions. The state-of-the-art on methods of multi-robot search across several selected domains of application is explained, highlighting the pros and cons of each method, providing an up-to-date view on the current state of the domains and their future challenges
Mobile robotic network deployment for intruder detection and tracking
This thesis investigates the problem of intruder detection and tracking using mobile robotic networks. In the first part of the thesis, we consider the problem of seeking an electromagnetic source using a team of robots that measure the local intensity of the emitted signal. We propose a planner for a team of robots based on Particle Swarm Optimization (PSO) which is a population based stochastic optimization technique. An equivalence is established between particles generated in the traditional PSO technique, and the mobile agents in the swarm. Since the positions of the robots are updated using the PSO algorithm, modifications are required to implement the PSO algorithm on real robots to incorporate collision avoidance strategies. The modifications necessary to implement PSO on mobile robots, and strategies to adapt to real environments are presented in this thesis. Our results are also validated on an experimental testbed.
In the second part, we present a game theoretic framework for visibility-based target tracking in multi-robot teams. A team of observers (pursuers) and a team of targets (evaders) are present in an environment with obstacles. The objective of the team of observers is to track the team of targets for the maximum possible time. While the objective of the team of targets is to escape (break line-of-sight) in the minimum time. We decompose the problem into two layers. At the upper level, each pursuer is allocated to an evader through a minimum cost allocation strategy based on the risk of each evader, thereby, decomposing the agents into multiple single pursuer-single evader pairs. Two decentralized allocation strategies are proposed and implemented in this thesis. At the lower level, each pursuer computes its strategy based on the results of the single pursuer-single evader target-tracking problem. We initially address this problem in an environment containing a semi-infinite obstacle with one corner. The pursuer\u27s optimal tracking strategy is obtained regardless of the evader\u27s strategy using techniques from optimal control theory and differential games. Next, we extend the result to an environment containing multiple polygonal obstacles. We construct a pursuit field to provide a guiding vector for the pursuer which is a weighted sum of several component vectors. The performance of different combinations of component vectors is investigated. Finally, we extend our work to address the case when the obstacles are not polygonal, and the observers have constraints in motion
Defense Against Smart Invaders with Swarms of Sweeping Agents
The goal of this research is to devise guaranteed defense policies that allow
to protect a given region from the entrance of smart mobile invaders by
detecting them using a team of defending agents equipped with identical line
sensors. By designing cooperative defense strategies that ensure all invaders
are detected, conditions on the defenders' speed are derived. Successful
accomplishment of the defense task implies invaders with a known limit on their
speed cannot slip past the defenders and enter the guarded region undetected.
The desired outcome of the defense protocols is to defend the area and
additionally to expand it as much as possible. Expansion becomes possible if
the defenders' speed exceeds a critical speed that is necessary to only defend
the initial region. We present results on the total search time, critical
speeds and maximal expansion possible for two types of novel pincer-movement
defense processes, circular and spiral, for any even number of defenders. The
proposed spiral process allows to detect invaders at nearly the lowest
theoretically optimal speed, and if this speed is exceeded, it also allows to
expand the protected region almost to the maximal area.Comment: 18 pages, 21 figure
Recommended from our members
A Theory of Collective Cell Migration and the Design of Stochastic Surveillance Strategies
In nature, complex emergent behavior arises in groups of biological entities often as a result of simple local interactions between neighbors in space or on a network. In such cases, scientific inquiry is typically aimed at inferring these local rules. Conversely, in teams of robots, the goal is to create decentralized control laws which results in efficient global behavior. These behaviors are designed for tasks such as maintaining formation control, performing effective coverage control or persistently monitoring an environment. With this in mind, we consider the following: 1> the emergence of collective cell migration from local contact and mechanical feedback and 2> the design of unpredictable surveillance strategies for teams of robots.Collective cell migration is an essential part of tissue and organ morphogenesis during embryonic development, as well as of various disease processes, such as cancer. The vast majority of theoretical descriptions of collective cell behavior focus on large numbers of cells, but fail to accurately capture the dynamics of small groups of cells. Here we introduce a low-dimensional theoretical description that successfully describes single cell migration, cell collisions, collective dynamics in small groups of cells, and force propagation during sheet expansion, all within a common theoretical framework. We also explain the counter-intuitive observation that pairs of cells repel each other upon collision while they coordinate their motion in larger clusters.Conventional monitoring strategies used by teams of robots are deterministic in nature making it possible for intelligent intruders who study the motion of the patrolling agent to compromise the patrol route. This problem can be solved by designing random walkers on graphs which naturally incorporate unpredictability. Within this framework, we study and provide the first analytic expression for the first meeting time of multiple random walkers, in terms of their transition matrices. We also study two problems related to maximizing unpredictability: given graph and visit frequency constraints, 1> maximize the entropy rate generated by a Markov chain, and 2> maximize the return time entropy associated with the Markov chain, where the return time entropy is the weighted average over all graph nodes of the entropy of the first return times of the Markov chain
“Be a Pattern for the World”: The Development of a Dark Patterns Detection Tool to Prevent Online User Loss
Dark Patterns are designed to trick users into sharing more information or spending more money than they had intended to do, by configuring online interactions to confuse or add pressure to the users. They are highly varied in their form, and are therefore difficult to classify and detect. Therefore, this research is designed to develop a framework for the automated detection of potential instances of web-based dark patterns, and from there to develop a software tool that will provide a highly useful defensive tool that helps detect and highlight these patterns
Technical Debt is an Ethical Issue
We introduce the problem of technical debt, with particular focus on critical infrastructure, and put forward our view that this is a digital ethics issue. We propose that the software engineering process must adapt its current notion of technical debt – focusing on technical costs – to include the potential cost to society if the technical debt is not addressed, and the cost of analysing, modelling and understanding this ethical debt. Finally, we provide an overview of the development of educational material – based on a collection of technical debt case studies - in order to teach about technical debt and its ethical implication
Minding the Gap: Computing Ethics and the Political Economy of Big Tech
In 1988 Michael Mahoney wrote that “[w]hat is truly revolutionary about the computer will become clear only when computing acquires a proper history, one that ties it to other technologies and thus uncovers the precedents that make its innovations significant” (Mahoney, 1988). Today, over thirty years after this quote was written, we are living right in the middle of the information age and computing technology is constantly transforming modern living in revolutionary ways and in such a high degree that is giving rise to many ethical considerations, dilemmas, and social disruption. To explore the myriad of issues associated with the ethical challenges of computers using the lens of political economy it is important to explore the history and development of computer technology
- …