{"title":"Tree Measurement in Forest by 2D Laser Scanning","authors":"Jaakko Jutila, Kosti Kannas, A. Visala","doi":"10.1109/CIRA.2007.382858","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382858","url":null,"abstract":"Measurement of tree parameters, particularly tree diameter and location, in connection to forest harvesters, is discussed. Diameters are determined from laser scanner measurements using a simple method based on edge points of a feature, in addition to the point with the shortest range to the scanner. The measurement height is equal to 1.3 m from the ground. The data for this research have been collected in a pine forest using a 2D laser scanner mounted on a mobile ATV platform. The error of the tree diameter calculations is 4% in average. The evaluation of the tree localization is based on manually measured reference data of the forest.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115650604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of a Parallel Architecture and Algorithm for Mapping and Localization","authors":"D. Lyons, Giselle R. Isner","doi":"10.1109/CIRA.2007.382895","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382895","url":null,"abstract":"The Beowulf cluster approach to parallel computation offers a potentially cheap and robust source of computational power for high complexity algorithms in robotics. The challenge is to integrate this approach with the mobility and time critical response constraints of many robotic algorithms. The key contributions of this paper are: (1) introduction of a computational architecture for integrating a cluster into the control architecture of one or more robots, (2) a cluster implementation of Thrun et al's Concurrent Localization and Mapping (CML) algorithm, and (3) presentation of results to illustrate the performance of the implemented CML algorithm and validate the architectural approach.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Heuristic Search To Find Stable High-Order Single-Bit Delta Sigma Modulators","authors":"S. Skogstad, M. Høvin","doi":"10.1109/CIRA.2007.382866","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382866","url":null,"abstract":"A heuristic search for stable high-order delta sigma modulators is presented. Searches guided by the Linear Model found stable modulators with higher SNR performance compared to classical filter design techniques. The presented design approach is both more automatic than classical design and can also be weighted such to direct the search toward designs for special purpose. A novel adaptive modulator concept is also presented.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algebraic interval constraint driven exploration in human-agent collaborative problem solving","authors":"Yan Wang","doi":"10.1109/CIRA.2007.382872","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382872","url":null,"abstract":"To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized intervals. With logically quantified intervals, semantics and intent can be integrated in numerical computing. The interpretable numerical results allow for better human-agent communication.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131861810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Micro Planar Parallel Mechanism Design using Configuration Change Effect of Flexure Mechanism","authors":"B. Kang, K. R. Cho","doi":"10.1109/CIRA.2007.382899","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382899","url":null,"abstract":"Flexure joints are frequently used in precision mechanisms, from motion stages to micro-robots. Due to their monolithic construction and superior wear and loss properties, flexure joints can be used to reduce the mechanism size and increase the positioning accuracy. The compliance of flexure joints, however, can affect the static and dynamic characteristics of the overall mechanism. The objective of this paper is to develop analysis and design tools for general platform type parallel mechanisms that contain flexure joints. In this paper, a micro planar parallel mechanism that has 3-DOF motion is examined by considering the configuration change effect. Usually, MEMS mechanism is designed for a specific purpose with a motion restriction. Here, using the conventional planar parallel robotics design, a general purpose of micro mechanism is presented.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132873057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Problem Solving Environment for Combinatorial Optimization Based on Parallel Meta-heuristics","authors":"Rong Huang, Shurong Tong, W. Sheng, Zhun Fan","doi":"10.1109/CIRA.2007.382922","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382922","url":null,"abstract":"Computational grid offers a great potential solution to parallel meta-heuristics toward combinatorial optimization. However, it is quite difficult for specialists in combinatorial optimization to develop parallel meta-heuristics in extremely heterogeneous computational environment, starting from scratch without any toolkit. This paper presents a problem solving environment for combinatorial optimization based on parallel meta-heuristics (PSEPMH) to help specialists to harness heterogeneous computational resources and handle dynamic granularity control. PSEPMH requires specialist to decompose one problem into two sub-problems with divide-and-conquer framework just as generic sequential algorithm. Then compiler of PSEPMH generates mobile agent code that automatically forms adaptive multi-granularity parallel computing at runtime by cloning himself and distributing along dynamic, complex grid environment with the support of PSEPMH. Not only can PSEPMH relieve specialists' burden, but also make use of the computational resources more efficiently.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131346242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Potentially Distributable Energy: Towards Energy Autonomy in Large Population of Mobile Robots","authors":"T. Ngo, Hector Raposo, H. Schiøler","doi":"10.1109/CIRA.2007.382875","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382875","url":null,"abstract":"We propose a new concept, potentially distributable energy, in the field of autonomous mobile robots. Considering a system of multiple robots powered by batteries, each robot no longer works since its energy capacity is expired. To extend operating time, the robot needs to replenish energy through recharging energy. To date, except research on vaccum cleaning robots that are able to recharge battery when docking with the fixed station has been achieved, there does not exist any research of energy distribution to prolong operating time in a large population of mobile robots. This could be caused by the lack of using rechargeable battery in the fact that the robot has to normally spend the charging-time much longer than the operating time. This paper presents simulation results of mobile robots that are capable of not only self-recharging energy but also exchanging batteries to the other robots. Initially, we describe a simulation of multiple mobile robots, and then issue rules of battery exchange, which is formulated under constraints of workload, distance and remaining capacity. The simulation shows that: (a) a robot is able to be energetically autonomous if its energy can be replenished by the other robots or it is able to come back to the main charging station to replenish itself; (b) energy of a robot is always under constraints of energy distribution of the mother charging station and the other robots; (c) distributed energy balance is the main elements to decide a number of robots in a specific area and an ideal location of the repository when one wants to deploy a large population of autonomous mobile robots. Finally, based on results of the simulation we adjust rules for our real multirobot system.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131480831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New Results in Understanding Performance and Vulnerability in Complex Networks","authors":"D. Repperger","doi":"10.1109/CIRA.2007.382833","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382833","url":null,"abstract":"New results can be obtained about performance and vulnerability of complex networks through the common intersection of the fields of graph theory, information theory, and optimization theory. Graph theory provides a basis of architecture and also constraint relationships for key flow variables. Information theory provides measures and metrics of flow performance. The optimization of complex networks is accomplished via genetic algorithms on the flow variables. By performing a minimum flow and maximum flow optimization, a sensitivity matrix of vulnerabilities of a network can be ascertained. Thus the most vulnerable set of nodes can be determined. This procedure is first applied to a logistics network. The generalization to communication's networks and other distributed complex systems is discussed.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131726780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self Organized Networks for Optimal Feature Extraction","authors":"Y. A. Ghassabeh, H. Moghaddam","doi":"10.1109/CIRA.2007.382908","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382908","url":null,"abstract":"In this paper, we introduced new adaptive learning algorithms and related networks to extract optimal features from multidimensional data in order to reduce the data dimensionality while preserving class separability. For this purpose, new adaptive algorithms for the computation of the square root of the inverse covariance matrix Sigma-1/2 are introduced. We introduce a new cost function related to the given adaptive learning algorithms in order to prove their convergence. Self organized Sigma-1/2 networks are constructed based on these algorithms. By cascading Sigma-1/2 network and an adaptive principal component analysis (APCA) network, we present new adaptive self organized LDA feature extraction network. Adaptive nature of the new optimal feature extraction method makes it appropriate for on-line incremental pattern classification and machine learning applications. Both networks in the proposed structure are trained simultaneously, using a stream of input data. Existence of cost function, make it available to compute learning rate efficiently in every iteration in order to increase the convergence rate. Experimental results using synthetic multi-class multi-dimensional sequence of data, demonstrated the effectiveness of the new adaptive self organized feature extraction networks.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126658790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The 2005 DARPA Grand Challenge","authors":"C. Crane","doi":"10.1109/CIRA.2007.382834","DOIUrl":"https://doi.org/10.1109/CIRA.2007.382834","url":null,"abstract":"The presentation describes the development of an autonomous vehicle system that participated in the 2005 DARPA Grand Challenge event. After a brief description of the event, the architecture, based on version 3.0 of the DoD Joint Architecture for Unmanned Systems (JAUS), and design of the system are presented in detail. In particular, the \"smart sensor\" concept is introduced which provided a standardized means for each sensor to present data for rapid integration and arbitration. Information about the vehicle design, system localization, perception sensors, and the dynamic planning algorithms that were used is then presented in detail. Subsequently, testing results and performance results are presented. Lastly, current activities related to the 2007 DARPA Urban Challenge are presented.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126924134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}