New Zealand

Antonio Sgorbissa (December 1st 2006). Multi-Robot Systems and Distributed Intelligence: The ETHNOS Approach to Heterogeneity, Mobile Robotics, Moving Intelligence, Jonas Buchli, IntechOpen, DOI: 10.5772/4733.

Joaqu&iacute;n Izquierdo, Idel Montalvo, Rafael P&eacute;rez-Garc&iacute;a and Carlos D. Alonso (February 1st 2010). Swarm Intelligence for Optimization in the Urban Water Industry, Modelling, Simulation and Optimization, Gregorio Romero Rey and Luisa Martinez Muneta, IntechOpen, DOI: 10.5772/7659. 

Shuhua Liu, Tieli Sun and Chih-cheng Hung (January 30th 2011). Multi-Robot Task Allocation Based on Swarm Intelligence, Multi-Robot Systems, Trends and Development, Toshiyuki Yasuda, IntechOpen, DOI: 10.5772/13106.

AAMAS 2020

Optimal Swarm Strategy for Dynamic Target Search and Tracking

dynamic target search

multi-robot systems

swarm intelligence

**31st IEEE International Conference on Robot & Human Interactive Communication**
 This conference is a leading forum where state-of-the-art innovative results, the latest developments as well as future perspectives relating to robot and human interactive communication are presented and discussed.
 
 The conference covers a wide range of topics related to Robot and Human Interactive Communication, involving theories, methodologies, technologies, empirical and experimental studies. Papers related to the study of robotic technology, psychology, cognitive science, artificial intelligence, human factors, ethics and policies, interaction-based robot design and other topics related to human-robot interaction are welcome.
 
 **CONFERENCE THEME:**
 Social, asocial, and antisocial robots
 
 Robots are starting to populate our lives: at work, in our homes, hotels, shops. However, not everybody is comfortable with robots finding a place in society. For example, people may be afraid that robots will replace humans in their jobs. This belief is exacerbated by the media that, on one side, raise expectations of robots’ capabilities, while amplifying fears and worries on the other side.
 
 In the next years, due to the increasing request for interaction with people in social environments, academic research and market analyses predict that robots will become more and more “social”. But, at the same time, robots may incur the risk of being perceived as “asocial” as their pervasiveness in everyday environments may become an obstacle to social interaction between humans. Or they may even be rejected as “antisocial” if researchers do not take care to develop robots that behave according to the customs and habits of the communities where they are expected to operate.
 
 To prevent this from happening, robotic researchers can no longer take the luxury of being mere technicians. They must be capable of addressing all the challenges raised by future robot-populated communities in a multidisciplinary way. They need to share their knowledge with the public to make people aware of what robots really are, what expectations we can have from them, the risks we may incur, and the possible mitigation plans.
 
 While being open to any kind of contribution related to Human-Robot Interactive Communication, the RO-MAN 2022 conference will emphasize these aspects of robotic research. How can we create robots capable of being welcomed as our assistants and companions in society while, at the same time, not being perceived as “asocial” or “antisocial?” How can we create robots perceived as facilitators of the natural development of human beings and communities, rather than obstacles?
 
 Contributions from different disciplines, not exclusively related to technological development, will be welcomed as crucial to pave the way to global acceptance of future robots with an informed attitude.
 
 [![](https://assets.underline.io/uploads/markdown_image/1/image/af259abe105b3791c498ae1552d75710.png)](https://drive.google.com/file/d/18w73BZPB_JVOgcrcdZDqYpEupwVt4CnU/view?usp=sharing)

A registration is required to access this event page. If you have not already done so, please use the below link to register for the event. 

[Register Here](http://www.smile.unina.it/ro-man2022/welcome-to-ieee-ro-man-2022/)

Registration Is Required

IEEE RO-MAN 2022

31st IEEE International Conference on Robot & Human Interactive Communication
This conference is a leading forum where state-of-the-art innovative results, the latest developments as well as future perspectives relating to robot and human interactive communication are presented and discussed.

technical paper

AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally-respected archival forum for scientific research in the theory and practice of autonomous agents and multi-agent systems.

Browse keynotes, discussions, panels and over 300 presentations.


AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). 

Conditional Updates of Answer Set Programming and its Applicationin Explainable Planning

Summer Internship Matching with Funding Constraints

Autonomous Shape Formation and Morphing in a Dynamic Environment by a Swarm of Robots

In this demonstration, we introduce a system that facilitates trading agent competitions. Competitions mirror a Walrasian Exchange Economy. Each agent is endowed with a set of digital assets and preferences over them. Agents then search for sellers of the assets they demand and buyers of the assets they sell. They negotiate one- on-one to arrive at an optimal trade, and if successful, settle their transaction trustlessly on an emulated permissionless blockchain. This system is a precursor to a trading platform for digital assets and crypto-tokens in which agents trade on behalf of their users.


Trading Agent Competition with Autonomous Economic Agents

"We present VerSecTis -- a new experimental tool for the verification of timed security protocols' (TSP) modelled by Timed Interpreted Systems (TIS).
In addition to the TSP's time-independent properties, our tool can also examine the time dependencies of the TSP's executions on which their security depends.
The verification method consists of a new TSPs' modelling method and
a translation of the reachability problem for TIS to the Satisfiability Modulo Theories problem. We also deliver nineteen TSPs to verify, and we plan to expand the tool with further protocols."

VerSecTis - An Agent Based Model Checker for Security Protocols (Demo)

**Please click on the button bellow to see this lecture on SlidesLive:**

[![](https://assets.underline.io/uploads/markdown_image/1/image/08e10ad349922f32e7322b77b8df9019.png)](https://slideslive.com/38946802/boston-dynamics)

**Abstract:**

Hurricanes are devastating natural disasters. In deciding how to respond to a hurricane, in particular whether and when to evacuate, a decision-maker must weigh often highly uncertain and contradictory information about the future path and intensity of the storm. To effectively plan to help people during a hurricane, it is crucial to be able to predict and understand this evacuation decision. To this end, we propose a computational model of human sequential decision-making in response to a hurricane based on a Partial Observable Markov Decision Process (POMDP) that models concerns, uncertain beliefs about the hurricane, and future information. We evaluate the model in two ways. First, hurricane data from 2018 was used to evaluate the model's predictive ability on real data. Second, a simulation study was conducted to qualitatively evaluate the sequential aspect of the model. The evaluation with hurricane data shows that our proposed features are significant predictors and they can predict the data well, within and across distinct hurricane datasets. The simulation results show that, across different setups, our model generates predictions on the sequential decisions making aspect that align with expectations qualitatively and suggests the importance of modeling information.

A Computational Model of Human Hurricane Evacuation Decision

We propose a new perspective on adversarial attacks against deep reinforcement learning agents. Our main contribution is CopyCAT, a targeted attack able to consistently lure an agent into following an outsider's policy. It is pre-computed, therefore fast inferred, and could thus be usable in a real-time scenario. We show its effectiveness on Atari 2600 games in the novel read-only setting. In this setting, the adversary cannot directly modify the agent's state - its representation of the environment - but can only attack the agent's observation - its perception of the environment. Directly modifying the agent's state would require a write-access to the agent's inner workings and we argue that this assumption is too strong in realistic settings.

CopyCAT: Taking Control of Neural Policies with Constant Attacks

Multirobot systems for covering environments are increasingly used in applications like cleaning, industrial inspection, patrolling, and precision agriculture. The problem of covering a given environment using multiple robots can be naturally formulated and studied as a multi-Traveling Salesperson Problem (mTSP). In a mTSP, the environment is represented as a graph and the goal is to find tours (starting and ending at the same depot) for the robots in order to visit all the vertices with minimum global cost, namely the length of the longest tour. The mTSP is an NP-hard problem for which several approximation algorithms have been proposed. These algorithms usually assume generic environments, but tighter approximation bounds can be reached focusing on specific environments. In this paper, we address the case of environments composed of sub-parts, called modules, that can be reached from each other only through some linking structures. Examples are multi-floor buildings, in which the modules are the floors and the linking structures are the staircases or the elevators, and floors of large hotels or hospitals, in which the modules are the rooms and the linking structures are the corridors. We focus on linear modular environments, with the modules organized sequentially, presenting an efficient (with polynomial worst-case time complexity) algorithm that finds a solution for the mTSP whose cost is within a bounded distance from the cost of the optimal solution. The main idea of our algorithm is to allocate disjoint "blocks" of adjacent modules to the robots, in such a way that each module is covered by only one robot. We experimentally compare our algorithm against some state-of-the-art algorithms for solving mTSPs in generic environments and show that it is able to provide solutions with lower makespan and spending a computing time several orders of magnitude shorter.

Downloads

Next from AAMAS 2020

Conditional Updates of Answer Set Programming and its Applicationin Explainable Planning

Similar lecture

Exploring Theory of Mind for Human-Robot Collaboration

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAMAS 2020

Conditional Updates of Answer Set Programming and its Applicationin Explainable Planning

Similar lecture

Exploring Theory of Mind for Human-Robot Collaboration

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads