University of Udine

About: University of Udine is a education organization based out in Udine, Italy. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 6745 authors who have published 20530 publications receiving 669088 citations. The organization is also known as: Università degli Studi di Udine & Universita degli Studi di Udine.

Path Planning and Trajectory Planning Algorithms: A General Overview

Abstract: Path planning and trajectory planning are crucial issues in the field of Robotics and, more generally, in the field of Automation. Indeed, the trend for robots and automatic machines is to operate at increasingly high speed, in order to achieve shorter production times. The high operating speed may hinder the accuracy and repeatability of the robot motion, since extreme performances are required from the actuators and the control system. Therefore, particular care should be put in generating a trajectory that could be executed at high speed, but at the same time harmless for the robot, in terms of avoiding excessive accelerations of the actuators and vibrations of the mechanical structure. Such a trajectory is defined as smooth. For such reasons, path planning and trajectory planning algorithms assume an increasing significance in robotics. Path planning algorithms generate a geometric path, from an initial to a final point, passing through pre-defined via-points, either in the joint space or in the operating space of the robot, while trajectory planning algorithms take a given geometric path and endow it with the time information. Trajectory planning algorithms are crucial in Robotics, because defining the times of passage at the via-points influences not only the kinematic properties of the motion, but also the dynamic ones. Namely, the inertial forces (and torques), to which the robot is subjected, depend on the accelerations along the trajectory, while the vibrations of its mechanical structure are basically determined by the values of the jerk (i.e. the derivative of the acceleration). Path planning algorithms are usually divided according to the methodologies used to generate the geometric path, namely: roadmap techniques cell decomposition algorithms artificial potential methods.

A comparison of bibliometric indicators for computer science scholars and journals on Web of Science and Google Scholar

Abstract: Given the current availability of different bibliometric indicators and of production and citation data sources, the following two questions immediately arise: do the indicators’ scores differ when computed on different data sources? More importantly, do the indicator-based rankings significantly change when computed on different data sources? We provide a case study for computer science scholars and journals evaluated on Web of Science and Google Scholar databases. The study concludes that Google scholar computes significantly higher indicators’ scores than Web of Science. Nevertheless, citation-based rankings of both scholars and journals do not significantly change when compiled on the two data sources, while rankings based on the h index show a moderate degree of variation.

Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

Abstract: The Second International Timetabling Competition (TTC2007) opened in August 2007. Building on the success of the first competition in 2002, this sequel aimed to further develop research activity in the area of educational timetabling. The broad aim of the competition was to create better understanding between researchers and practitioners by allowing emerging techniques to be developed and tested on real-world models of timetabling problems. To support this, a primary goal was to provide researchers with models of problems faced by practitioners through incorporating a significant number of real-world constraints. Another objective of the competition was to stimulate debate within the widening timetabling research community. The competition was divided into three tracks to reflect the important variations that exist in educational timetabling within higher education. Because these formulations incorporate an increased number of “real-world” issues, it is anticipated that the competition will now set the research agenda within the field. After finishing in January 2008, final results were made available in May 2008. Along with background to the competition, the competition tracks are described here along with a brief overview of the techniques used by the competition winners.

Ruthenium(II) terdentate CNN complexes: superlative catalysts for the hydrogen-transfer reduction of ketones by reversible insertion of a carbonyl group into the Ru-H bond.

Abstract: Geringe Katalysatormengen und kurze Reaktionsdauer genugen zur quantitativen Reduktion von Ketonen durch 2-Propanol und den Komplex [RuX(CNN)(dppb)] (siehe Struktur; X=H, Cl), dessen dreizahniger Ligand sich von 6-(4-Methylphenyl)-2-pyridylmethylamin ableitet. Die Reduktion scheint uber eine reversible Insertion des Substrats in die Ru-H-Bindung zu verlaufen, bei der ein RutheniumII)-alkoxid entsteht. dppb=Ph2P(CH2)4PPh2.