Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por CPES

2016

The Extraction from News Stories a Causal Topic Centred Bayesian Graph for Sugarcane

Autores
Drury, B; Rocha, C; Moura, MF; Andrade Lopes, Ad;

Publicação
IDEAS

Abstract
Sugarcane is an important product to the Brazilian economy because it is the primary ingredient of ethanol which is used as a gasoline substitute. Sugarcane is aflected by many factors which can be modelled in a Bayesian Graph. This paper describes a technique to build a Causal Bayesian Network from information in news stories. The technique: extracts causal relations from news stories, converts them into an event graph, removes irrelevant information, solves structure problems, and clusters the event graph by topic distribution. Finally, the paper describes a method for generating inferences from the graph based upon evidence in agricultural news stories. The graph is evaluated through a manual inspection and with a comparison with the EMBRAPA sugarcane taxonomy.

2016

PAMPO: using pattern matching and pos-tagging for effective Named Entities recognition in Portuguese

Autores
Rocha, C; Jorge, A; Sinoara, RA; Brito, P; Pimenta, C; Rezende, SO;

Publicação
CoRR

Abstract

2016

Collective Intelligence and Collaboration: A Case Study in Airline Industry

Autores
Teixeira, SAC; Campos, P; Fernandes, R; Roseira, C;

Publicação
COLLABORATION IN A HYPERCONNECTED WORLD

Abstract
In order to improve their competitive performance, airline companies often adopt as a strategy to establish arrangement between two or more organizations agreeing to cooperate on a substantial level. This strategy is often known as airline alliances. A paradigm to analyze the collective intelligence behavior which emerges from a group, as a strategic alliance, is the flocking behavior. Inspired by the Cucker and Smale algorithm (C-S) we propose a new version of the flocking behavior algorithm applied to airline alliances. Our goal is to understand the link between strategic alliances and flocks. For this new approach, metrics were obtained for the parameters of C-S algorithm, namely position, velocity and influence, where the latter uses cooperative games. Besides, reinforcement learning mechanisms have been explored. Some relevant outputs for airline alliances as the permanence rate and the growth rate were computed for each of the five configurations in analysis.

2016

Localization and Navigation of an Omnidirectional Mobile Robot: The Robot@Factory Case Study

Autores
Costa, PJ; Moreira, N; Campos, D; Goncalves, J; Lima, J; Costa, PL;

Publicação
IEEE REVISTA IBEROAMERICANA DE TECNOLOGIAS DEL APRENDIZAJE-IEEE RITA

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.

2016

Modeling and Simulation of a Hacked Neato XV-11 Laser Scanner

Autores
Campos, D; Santos, J; Goncalves, J; Costa, P;

Publicação
ROBOT 2015: SECOND IBERIAN ROBOTICS CONFERENCE: ADVANCES IN ROBOTICS, VOL 1

Abstract
Laser scanners are widely used in mobile robotics localization systems but, despite the enormous potential of its use, their high price tag is a major drawback, mainly for hobbyist and educational robotics practitioners that usually have a reduced budget. This paper presentes the modeling and simulation of a hacked Neato XV-11 Laser Scanner, having as motivation the fact that it is a very low cost alternative, when compared with the current available laser scanners. The modeling of a hacked Neato XV-11 Laser Scanner allows its realistic simulation and provides valuable information that can promote the development of better designs of robot localization systems based on this sensor. The sensor simulation was developed using SimTwo, which is a realistic simulation software that can support several types of robots.

2016

Towards a Reliable Robot for Steep Slope Vineyards Monitoring

Autores
dos Santos, FN; Sobreira, H; Campos, D; Morais, R; Moreira, AP; Contente, O;

Publicação
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS

Abstract
Develop ground robots for crop monitoring and harvesting in steep slope vineyards is a complex challenge. Because of two main reasons: harsh condition of the terrain and unstable localization accuracy got from Global Positioning Systems (GPS). This paper presents a hybrid SLAM (VineSLAM) considering low cost landmarks to increase the robot localization accuracy, robustness and redundancy on these steep slope vineyards. Also, we present a cost-effective robot to carry-out crop monitoring tasks in steep slope vineyard environment. Test results got in a simulated and in a real test case supports the proposed approach and robot.

  • 209
  • 367