Robot Interaction has always been a challenge in collaborative robotics. In tasks comprising Inter-Robot Interaction, robot detection is very often needed. We explore humanoid robots detection because, humanoid robots can be useful in many scenarios, and everything from helping elderly people live in their own homes to responding to disasters. Cameras are chosen because they are reach and cheap sensors, and there are lots of mature two-dimensional (2D) and 3D computer vision libraries which facilitate Image analysis. To tackle humanoid robot detection effectively, we collected a data set of various humanoid robots with different sizes in different environments. Afterward, we tested the well-known cascade classifier in combination with several image descriptors like Histograms of Oriented Gradients (HOG), Local Binary Patterns (LBP), etc. on this data set. Among the feature sets, Haar-like has the highest accuracy, LBP the highest recall, and HOG the highest precision. Considering Inter-Robot Interaction, it is evident that false positives are less troublesome than false negatives, thus LBP is more useful than the others.

This study presents the algorithm for a humanoid robot to accomplish an obstacle run in the FIRA HuroCup competition. It includes the integration of image processing and robot motion. DARwIn-OP (Dynamic Anthropomorphic Robot with Intelligence–Open Platform) was used as the humanoid robot, and it is equipped with a webcam as a vision system to obtain an image of what is in front of the robot. Image processing skills such as erosion, dilation, and eight-connected component labeling are applied to reduce image noise. Moreover, we use navigation grids with filters to avoid the obstacles. Fuzzy logic rules are used to implement the robot’s motion, allowing a humanoid robot to access any routes using obstacle avoidance to perform the tasks in the obstacle-run event.

An overview of research in the areas of aerospace applications of artificial intelligence, expert Systems, neural networks and robotics is presented. Challenges associated with aerospace projects require increasingly complex aerospace Systems which in turn demand automation and fault tolerance. We have addressed these issues and provided a survey of the research on intelligent Systems that has been carried out in an attempt to meet these challenges. The application areas we have overviewed include fault monitoring and diagnosis, generation and management of power in space, efficient and effective command and control, operations and maintenance of space stations, planning and scheduling, automation, and cockpit management.

Folksonomy gives liberty to its users to freely assign chosen keywords as tags, and this is the main reason behind its popularity. Apart from freedom, this system also reflects the collective intelligence of the crowd. However, this freedom and liberty can degrade quality of the folksonomy. It is required that quality of the folksonomy must remain consistently excellent and does not degrade with the passage of time. This is a survey paper, in which we present a brief survey of the research efforts intended to maintain a quality-protected folksonomy. We have organized our paper by looking at the problem from four aspects namely selection of quality tags, tag management features provided by folksonomy applications, folksonomy cleaning and interoperability of tags across platforms. We conclude our review with some of the interesting research topics, which need to be explored further. Our conclusion will be relevant and beneficial for engineers and designers who aim to design and maintain a quality-protected folksonomy.

An important aspect of any interactive computer system is its ease of use. On-line assistance is a major contributor to software usability. Conventional on-line assistance includes on-line documentation, or keyword access to textual help descriptions. More sophisticated on-line assistance includes intelligent help which provides immediate assistance for a specific problem, and intelligent training whose main goal is to support the user in learning about the system. These contemporary forms of intelligent assistance represent knowledge about the particular application, the user and the particular tasks the user is to perform. In addition, they possess inferencing capabilities to model the individual user's goals, plans, intentions and knowledge. This paper provides an overview of on-line assistance research, from empirical studies that attempt to determine the nature of effective assistance, to the design of intelligent on-line assistance systems capable of tailoring the assistance to the individual user. For readers interested in more details, recommendations for further reading in the related areas of advice-giving and intelligent help, intelligent user interfaces, critiquing, intelligent tutoring systems, and on-line documentation and hypertext are given.

This report is the result of a panel discussion at the Second UK Workshop on Foundations of Multi-Agent Systems (FOMAS'97). All members of the panel are authors, listed alphabetically.

This paper presents a conceptual and computational framework for supporting the development of knowledge management systems based on ontology design and implementation. This framework supports enterprises involved in the design and manufacturing of complex mechanical products: in particular, we focus our attention on a network of small/medium Italian enterprises that collaborates in the production of a supermotard bike called Terra Modena 198. Starting from some theoretical considerations about the role of ontologies in engineering design, this paper reflects on the difficulties that arise when knowledge is distributed, and misunderstanding and communication problems among partners could easily lead to errors in the final product.

The Simple Temporal Network (STN) is a widely used framework for reasoning about quantitative temporal constraints over variables with continuous or discrete domains. The inference tasks of determining consistency and deriving the minimal network are traditionally achieved by graph algorithms (e.g. Floyd-Warshall, Johnson) or by iteration of narrowing operators (e.g. ΔSTP). None of these methods exploits effectively the tree-decomposition structure of the constraint graph of an STN. Methods based on variable elimination (e.g. adaptive consistency) can exploit this structure, but have not been applied to STNs as far as they could, in part because it is unclear how to efficiently pass the ‘messages’ over continuous domains. We show that for an STN, these messages can be represented compactly as sub-STNs. We then present an efficient message-passing scheme for computing the minimal constraints of an STN. Analysis of this algorithm, Prop-STP, brings formal explanation of the performance of the existing STN solvers ΔSTP and SR-PC. Empirical results validate the efficiency of Prop-STP, demonstrating performance comparable to ΔSTP, in cases where the constraint graph is known to have small tree width, such as those that arise during Hierarchical Task Network planning.

Radio-Frequency Identification (RFID) system technology is a key element for the realization of the Industry 4.0 vision, as it is vital for tasks such as entity tracking, identification and asset management. However, the plethora of RFID systems’ elements in combination with the wide range of factors that need to be taken under consideration along with the interrelations amongst them, make the problem of identification and design of the right RFID system, based on users’ needs particularly complex. The research outlined in this paper seeks to optimize this process by developing an integrating schema that will encapsulate this information in a form that is both human and machine processible. Human readability will allow a shared understanding of the RFID technology domain; machine readability, automated reasoning engines to perform logical deduction techniques returning implicit information. For this purpose, the novel RFID System Configuration Ontology (RFID SCO) is developed. Hence, non-RFID experts are enabled to identify the most suitable RFID system according to their needs and RFID experts to retrieve all the relevant information required for the efficient design of the corresponding RFID system. The RFID SCO is validated and tested successfully against real-world scenarios provided by domain experts.

In order to enable robots to interact with humans in a natural way, they need to be able to autonomously learn new tasks. The most natural way for humans to tell another agent, which can be a human or robot, to perform a task is via natural language. Thus, natural human–robot interactions also require robots to understand natural language, i.e. extract the meaning of words and phrases. To do this, words and phrases need to be linked to their corresponding percepts through grounding. Afterward, agents can learn the optimal micro-action patterns to reach the goal states of the desired tasks. Most previous studies investigated only learning of actions or grounding of words, but not both. Additionally, they often used only a small set of tasks as well as very short and unnaturally simplified utterances. In this paper, we introduce a framework that uses reinforcement learning to learn actions for several tasks and cross-situational learning to ground actions, object shapes and colors, and prepositions. The proposed framework is evaluated through a simulated interaction experiment between a human tutor and a robot. The results show that the employed framework can be used for both action learning and grounding.

There is an implicit assumption in machine learning techniques that each new task has no relation to the tasks previously learned. Therefore, tasks are often addressed independently. However, in some domains, particularly reinforcement learning (RL), this assumption is often incorrect because tasks in the same or similar domain tend to be related. In other words, even though tasks are quite different in their specifics, they may have general similarities, such as shared skills, making them related. In this paper, a novel domain adaptation-based method using adversarial networks is proposed to do transfer learning in RL problems. Our proposed method incorporates skills previously learned from source task to speed up learning on a new target task by providing generalization not only within a task but also across different, but related tasks. The experimental results indicate the effectiveness of our method in dealing with RL problems.

The team-orienteering problem (TOP) has broad applicability. Examples of possible uses are in factory and automation settings, robot sports teams, and urban search and rescue applications. We chose the rescue domain as a guiding example throughout this paper. Hence, this paper explores a practical variant of TOP with time window (TOPTW) for rescue applications by humanoid robots called TOPTWR. Due to the significant range of algorithm choices and their parameters tuning challenges, the use of hyper-heuristics is recommended. Hyper-heuristics can select, order, or generate different low-level heuristics with different optimization algorithms. In this paper, first, a general multi-objective (MO) solution is defined, with five objectives for TOPTWR. Then a robust and efficient MO and evolutionary hyper-heuristic algorithm for TOPTW based on the humanoid robot’s characteristics in the rescue applications (MOHH-TOPTWR) is proposed. MOHH-TOPTWR includes two MO evolutionary metaheuristics algorithms (MOEAs) known as non-dominated sorting genetic algorithm (NSGA-III) and MOEA based on decomposition (MOEA/D). In this paper, new benchmark instances are proposed for rescue applications using the existing ones for TOPTW. The experimental results show that MOHH-TOPTWR in both MOEAs can outperform all the state-of-the-art algorithms as well as NSGA-III and MOEA/D MOEAs.

A humanoid robot developed to play multievent athletes like human has paved a way for interesting and popular robotics research. One of the great dreams is to develop a humanoid robot being able to challenge human athletes. Therefore, the challenge of humanoid robots to play archery against human is organized at Taichung, Taiwan, in HuroCup, FIRA 2018, on August 7th. The difficulties of developing humanoid robot are not just on playing archery. The humanoid robots for HuroCup must make use of the same hardware for the 10 events. In this paper, the design and implementation of the humanoid robot for archery are proposed under the trade off with other nine events. Therefore, the humanoid robot must have some special design and development on software. More specially, the humanoid robot must use professional bow to challenge human for archery competition. Therefore, in this paper, special shooting posture under constrained arm structure and motion planning of both arms for more torque to play professional bow are proposed. In addition, the further development of humanoid robot to improve archery shooting is summarized.

Multi-agent systems (MASs) are a form of distributed intelligence, where multiple autonomous agents act in a common environment. Numerous complex, real world systems have been successfully optimized using multi-agent reinforcement learning (MARL) in conjunction with the MAS framework. In MARL agents learn by maximizing a scalar reward signal from the environment, and thus the design of the reward function directly affects the policies learned. In this work, we address the issue of appropriate multi-agent credit assignment in stochastic resource management games. We propose two new stochastic games to serve as testbeds for MARL research into resource management problems: the tragic commons domain and the shepherd problem domain. Our empirical work evaluates the performance of two commonly used reward shaping techniques: potential-based reward shaping and difference rewards. Experimental results demonstrate that systems using appropriate reward shaping techniques for multi-agent credit assignment can achieve near-optimal performance in stochastic resource management games, outperforming systems learning using unshaped local or global evaluations. We also present the first empirical investigations into the effect of expressing the same heuristic knowledge in state- or action-based formats, therefore developing insights into the design of multi-agent potential functions that will inform future work.

Individual Evolutionary Learning (IEL) is a learning model based on the evolution of a population of strategies of an individual agent. In prior work, IEL has been shown to be consistent with the behavior of human subjects in games with a small number of agents. In this paper, we examine the performance of IEL in games with many agents. We find IEL to be robust to this type of scaling. With the appropriate linear adjustment of the mechanism parameter, the convergence behavior of IEL in games induced by Groves–Ledyard mechanisms in quadratic environments is independent of the number of participants.

Often, the problems encountered by applications and developments of software agents require further investigation and improvements of agents' social capacities, that is, of the properties enabling them to act adaptively in multiagent domains. This is so for at least three reasons. First, quite often software agents are designed for reasoning upon and interacting with other agents (both human and artificial), as is the case in client-server and personal assistants. Secondly, to accomplish their primary task, these systems ought to reason upon, predict and eventually coordinate with, or at least prevent obstacles from, other systems accomplishing the same or different tasks in a concurrent way (think of electronic commerce, meeting agents, etc.). Thirdly, many applications are actually distributed over a set of agents with their specific roles and tasks, which are expected to participate in a joint activity, aimed at achieving a given global outcome.

In this paper we present our experience of representing the knowledge behind HealthAgents (HA), a distributed decision support system for brain tumour diagnosis. Our initial motivation came from the distributed nature of the information involved in the system and has been enriched by clinicians’ requirements and data access restrictions. We present in detail the steps we have taken towards building our ontology starting from knowledge acquisition to data access and reasoning. We motivate our representational choices and show our results using domain examples used by clinical partners in HA.