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
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
There are several approaches to create the Humanoid robot gait planning. This problem presents a large number of unknown parameters that should be found to make the humanoid robot to walk. Optimization in simulation models can be used to find the gait based on several criteria such as energy minimization, acceleration, step length among the others. The energy consumption can also be reduced with elastic elements coupled to each joint. The presented paper addresses an optimization method, the Stretched Simulated Annealing, that runs in an accurate and stable simulation model to find the optimal gait combined with elastic elements. Final results demonstrate that optimization is a valid gait planning technique.

Abstract
This paper describes a procedure applied to model DC motors. An example of the procedure apply is shown for a 12V brushed DC motor, equipped with a 29:1 metal gearbox and an integrated quadrature encoder. It is described the developed setup applied to obtain the experimental data and the developed algorithm applied to estimate the actuator parameters. It was obtained an electro-mechanical dynamical model that describes the motor, its gear box and the encoder. The motivation to develop a simple and easy to assemble procedure that allows to model DC motors is due to the fact that these actuators are intensively used in mobile robotics, being realistic simulation, based in accurate sensor and actuator models, the key to speed up Robot Software developing time.

Abstract
The Robot@Factory competition was recently included in Robotica, the main Portuguese Robotics Competition. This robot competition takes place in an emulated factory plant, where automatic guided vehicles (AGVs) must cooperate to perform tasks. To accomplish their goals, the AGVs must deal with localization, navigation, scheduling, and cooperation problems that must be solved autonomously. This robot competition can play an important role in education due to its inherent multidisciplinary approach, which can motivate students to bridge different technological areas. It can also play an important role in research and development, because it is expected that its outcomes will later be transferred to real-world problems in manufacturing or service robots. By presenting a scaled-down factory shop floor, this competition creates a benchmark that can be used to compare different approaches to the challenges that arise in this kind of environment. The ability to alter the environment, in some restricted areas, can usually promote the test and evaluation of different localization mechanisms, which is not possible in other competitions. This paper presents one of the possible approaches to build a robot capable of entering this competition. It can be used as a reference to current and new teams.

Abstract
Usually the Industrial Automatic Guide Vehicles (AGVs) have two kind of lasers. One for navigation on the top and others for obstacle detection (security lasers). Recently, security lasers extended its output data with obstacle distance (contours) and reflectivity, that allows the development of a novel localization system based on a security laser. This paper addresses a localization system that avoids a dedicated laser scanner reducing the implementations cost and robot size. Also, performs a tracking system with precision and robustness that can operate AVGs in an industrial environment. Artificial beacons detection algorithm combined with a Kalman filter and outliers rejection method increase the robustness and precision of the developed system. A comparison between the presented approach and a commercial localization system for industry is presented. Finally, the proposed algorithms were tested in an industrial application under realistic working conditions.