Abstract
Self-localization of mobile robots in the environment is one of the most fundamental problems in the robotics field. It is a complex and challenging problem due to the high requirements of autonomous mobile vehicles, particularly with regard to algorithms accuracy, robustness and computational efficiency. In this paper we present the comparison of two of the most used map-matching algorithm, which are the Iterative Closest Point and the Perfect Match. This category of algorithms are normally applied in localization based on natural landmarks. They were compared using an extensive collection of metrics, such as accuracy, computational efficiency, convergence speed, maximum admissible initialization error and robustness to outliers in the robots sensors data. The test results were performed in both simulated and real world environments.

Abstract
This paper presents a centralized coordination scheme for multiple marine vehicles. The only requirements for proper operation of this method are the presence of bidirectional communication links with a virtual leader and bounded reference tracking errors. By relying on a, lower level, individual position tracking control, coordination is achieved by means of a centralized potential-field that uniquely defines the desired formation geometry as well as its position. The formation can be driven along a path that does not necessarily need to be predefined. Instead, a virtual leader defines the formation position at each instant of time. Furthermore, the possibility of setting stationary points over the path followed by the formation is guaranteed. The approach is illustrated in practice with autonomous surface vehicles in real environment, subjected to disturbances such as wind and waves.

Abstract
This paper presents a novel localization method for small mobile robots. The proposed technique is especially designed for the Robot@Factory, a new robotic competition which is started in Lisbon in 2011. The real-time localization technique resorts to low-cost infra-red sensors, a map-matching method and an Extended Kalman Filter (EKF) to create a pose tracking system that performs well. The sensor information is continuously updated in time and space according to the expected motion of the robot. Then, the information is incorporated into the map-matching optimization in order to increase the amount of sensor information that is available at each moment. In addition, the Particle Swarm Optimization (PSO) relocates the robot when the map-matching error is high, meaning that the map-matching is unreliable and the robot gets lost. The experiments presented in this paper prove the ability and accuracy of the presented technique to locate small mobile robots for this competition. Extensive results show that the proposed method presents an interesting localization capability for robots equipped with a limited amount of sensors, but also less reliable sensors.

Abstract
This letter presents a novel architecture for evaluating the success of picking operations that are executed by industrial robots. It is formed by a cascade of machine learning algorithms (kNN and SVM) and uses information obtained by a 6 axis force/torque sensor and, if available, information from the built-in sensors of the robotic gripper. Beyond measuring the success or failure of the entire operation, this architecture makes it possible to detect in real-time when an object is slipping during the picking. Therefore, force and torque signatures are collected during the picking movement of the robot, which is decomposed into five different stages that allows to characterize distinct levels of success over time. Several trials were performed using an industrial robot with two different grippers for picking a long and flexible object. The experiments demonstrate the reliability of the proposed approach under different picking scenarios since, it obtained a testing performance (in terms of accuracy) up to 99.5% of successful identification of the result of the picking operations, considering an universe of 400 attempts.

Abstract
In the past few years, cable-driven robots have received some attention by the scientific community and the industry. They have special characteristics that made them very reliable to operate with the level of safeness that is required by different environments, such as, handling of hazardous materials in construction sites. This paper presents a cable-driven robot called SPIDERobot, that was developed for automated construction of architectural projects. This robot has a rotating claw and it is controlled by a set of 4 cables that allow 4 degrees of freedom. In addition to the robot, this paper introduces a Dynamic Control System (DCS) that controls the positioning of the robot and assures that the length of cables is always within a safe value. Results show that traditional force-feasible approaches are more influenced by the pulling forces or the geometric arrangement of all cables and their positioning is significantly less accurate than the DCS. Therefore, the architecture of the SPIDERobot is designed to enable an easily scaling up of the solution to higher dimensions for operating in realistic environments.

Abstract
Automated Guided Vehicle System (AGVS) has become an important strategic tool for automated warehouses. In a very competitive business scenario, they can increase productivity and reduce costs of FMS (Flexible Manufacturing System) transportation systems. The AGV System provides efficient material flow and distribution among workstations at the right time and place. To attend such requirements, AGVS involves dispatching and scheduling of tasks and routing of AGVs. Some studies have approached such procedures in a similar form, although they have different functionalities. This paper reviews the literature related to the dispatching, scheduling and routing of AGVs (Automated Guided Vehicles) and highlights their main differences in comparison with the common management of vehicles transportation systems. To obtain a theoretical base, the definitions of dispatching, routing and scheduling procedures for materials handling applications are presented and the main methods to solve them are discussed.