Filters








37,908 Hits in 6.4 sec

NASA Airframe Structural Integrity Program [chapter]

Charles E. Harris
1991 Springer Series in Computational Mechanics  
A fracture mechanics evaluation of the concept of pressure proof testing the fuselage to screen for MSD has been completed.  ...  All long-term program elements have been initiated and the plans for the methodology verification program are being coordinated with the airframe manufacturers. 20, Security Classif (of this page) Unclassified  ...  NASA has developed several computational methods for computing stress intensity factor solutions to complex crack configurations.  ... 
doi:10.1007/978-3-642-84364-8_10 fatcat:k4kcczxobvfcbncbreo4nrieii

Fully continuous vector fields for mobile robot navigation on sequences of discrete triangular regions

Luciano C. A. Pimenta, Guilherme A. S. Pereira, Renato C. Mesquita
2007 Engineering of Complex Computer Systems (ICECCS), Proceedings of the IEEE International Conference on  
The basic idea of some of these works is to plan a path, by determining a sequence of neighboring discrete regions of the configuration space, and to assign a vector field that drives the robots through  ...  This paper addresses the problem of efficiently computing vector fields over a sequence of consecutive triangles.  ...  ACKNOWLEDGMENT The authors would like to thanks the financial support of FAPEMIG and CNPq -Brazil. The authors also thanks Alexandre Ramos Fonseca for his help with the figures.  ... 
doi:10.1109/robot.2007.363614 dblp:conf/icra/PimentaPM07 fatcat:4jwf7ykh3bcwzcq5obxxnlg77y

Proof planning for maintainable configuration systems

HELEN LOWE, MICHAL PECHOUCEK, ALAN BUNDY
1998 Artificial intelligence for engineering design, analysis and manufacturing  
We introduce two case studies: the initial proof of concept, which was in the domain of computer configuration, and a further field-tested study, the configuration of compressors.  ...  Central to our approach is the use of the proof planning technique, and the clean separation of different kinds of knowledge: factual, heuristic, and strategic.  ...  Our thanks go also to the anonymous referees who gave such helpful and constructive comments on an earlier version of this paper and helped to crystallise our ideas.  ... 
doi:10.1017/s0890060498124071 fatcat:hbyyyiktoveqlefywxqxzxshse

Guidelines for Formal Verification Systems [chapter]

1985 The 'Orange Book' Series  
The configuration management plan shall describe how changes are made to the plan itself and how emergency procedures are handled.  ...  CONFIGURATION MANAGEMENT PLAN Strict adherence to a comprehensive configuration management plan is one of the most important requirements for successful configuration management.  ... 
doi:10.1007/978-1-349-12020-8_6 fatcat:egbvfsveybgdzh4h5mpnr3uujm

Maintenance of Discovered Knowledge [chapter]

Michal Pěchouček, Olga Štěpánková, Petr Mikšovský
1999 Lecture Notes in Computer Science  
The presented case study is an attempt to analyse the relevant questions for a specific problem of industrial configuration of TV transmitters.  ...  Inductive Logic Programming (ILP) and Explanation Based Generalisation (EBG) within the Decision Planning (DP) knowledge representation methodology, have been studied, compared, and tested on this example  ...  The research has been partially supported by the Esprit Project 20237 ILP2 and by INCO 977102 ILPNET2.  ... 
doi:10.1007/978-3-540-48247-5_61 fatcat:sgfkjzsu3ffg3iok46jxprryky

Towards constrained motion planning of mobile manipulators

Mariusz Janiak, Krzysztof Tchon
2010 2010 IEEE International Conference on Robotics and Automation  
The operation of the constrained motion planning algorithm is illustrated by a motion planning problem of a mobile manipulator with bounds imposed on a platform variable.  ...  This paper addresses a constrained motion planning problem for mobile manipulators.  ...  The authors are indebted to an anonymous referee who pointed out the relevance of predictive control methodology in the context of this paper.  ... 
doi:10.1109/robot.2010.5509827 dblp:conf/icra/JaniakT10 fatcat:efgxba2vsba2nisd5ayv34gwcu

Locally Computable Navigation Functions for Sphere Worlds

Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Kyriakopoulos
2007 Engineering of Complex Computer Systems (ICECCS), Proceedings of the IEEE International Conference on  
This allows the computation of the navigation function using information from a single obstacle each time.  ...  We present simulations to verify the validity of this approach. by Khatib [4] as a low-level obstacle avoidance schema that used local sensing, preventing the robot from colliding to nearby obstacles.  ...  An interesting problem is to extend this NF, to others that limit the steepness of the NF.  ... 
doi:10.1109/robot.2007.363615 dblp:conf/icra/LionisPK07 fatcat:2uufv6pd25cnjhmp5wdap2ayky

CoPhy

Debabrata Dash, Neoklis Polyzotis, Anastasia Ailamaki
2011 Proceedings of the VLDB Endowment  
Our work is the first to reveal that the index tuning problem has a well structured space of solutions, and this space can be explored efficiently with well known techniques from linear optimization.  ...  ., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning.  ...  Under the hood, the BIP solver is able to reuse some of the initial computation in order to solve the augmented problem.  ... 
doi:10.14778/1978665.1978668 fatcat:ha4okf4qgncp3pt5ay6njtwcoy

Closed loop motion planning of cooperating mobile robots using graph connectivity

Guilherme Augusto Silva Pereira, Vijay Kumar, Mario Fernando Montenegro Campos
2008 Robotics and Autonomous Systems  
In this paper we address the problem of planning the motion of a team of cooperating mobile robots subject to constraints on relative configuration imposed by the nature of the task they are executing.  ...  We develop a decentralized motion control system that leads each robot to their individual goals while maintaining the constraints specified on the graph.  ...  We will extend this problem by defining the coordinated motion planning problem, where besides avoiding collisions the robots need to cooperate and maintain formation constraints in order to reach their  ... 
doi:10.1016/j.robot.2007.08.003 fatcat:k44xjyu6y5cd7easqxmdwkht2i

Towards the Mathematics Software Bus

Jacques Calmet, Karsten Homann
1997 Theoretical Computer Science  
Communication and cooperation mechanisms for logical and symbolic computation systems enable to study and solve new classes of problems and to perform efficient computation in mathematics through cooperating  ...  We give an overview on the need for cooperation in solving mathematical problems and illustrate the advantages by several well-known examples.  ...  An extension to distributed proof planning is to integrate the CAS SAPPER in the interactive proof development environment 0-MKRP, not at the system level but at the level of proofs [17] .  ... 
doi:10.1016/s0304-3975(97)00066-2 fatcat:xl6sovpvdbgpzohaegycja4edy

A G3-Continuous Extend Procedure for Path Planning of Mobile Robots with Limited Motion Curvature and State Constraints

Tomasz Gawron, Maciej Michałek
2018 Applied Sciences  
low computational cost in comparison to a G 3-continuous extend procedure based on η 3-splines.  ...  Given the initial and final robot configuration, we developed extend-procedure computing paths that can approximate RS paths with arbitrary precision, but guaranteeing G 3-continuity.  ...  The founding sponsors had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.  ... 
doi:10.3390/app8112127 fatcat:wxhtizsj35dndhpog6ynuua6jy

A Reachability-Based Planner for Sequences of Acyclic Contacts in Cluttered Environments [chapter]

S. Tonneau, N. Mansard, C. Park, D. Manocha, F. Multon, J. Pettré
2017 Springer Proceedings in Advanced Robotics  
As opposed to previous approaches, this property makes it possible to assert the relevance of a guide trajectory without explicitly computing contact configurations.  ...  In order to overcome the inherent combinatorial difficulty of this problem, we separate it in two subproblems: first, planning a guide trajectory for the root of the robot and then, generating relevant  ...  We propose a framework to address the motion planning problem for multiped robots in cluttered environments: given a start and a goal configuration, the objective is to compute a sequence of contact configurations  ... 
doi:10.1007/978-3-319-60916-4_17 dblp:conf/isrr/TonneauMPMMP15 fatcat:ci67be4eavhyxltwq2f2nzj3ua

Robot Navigation in Multi-terrain Outdoor Environments [chapter]

Guilherme A. S. Pereira, Luciano C. A. Pimenta, Luiz Chaimowicz, Alexandre R. Fonseca, Daniel S. C. de Almeida, Leonardo de Q. Corrêa, Renato C. Mesquita, Mario F. M. Campos
2008 Springer Tracts in Advanced Robotics  
This paper presents a methodology for motion planning in outdoor environments that takes into account specific characteristics of the terrain.  ...  After decomposing the map into triangular cells, a path planning algorithm is used to determine a discrete sequence of cells that minimizes the navigation cost.  ...  Acknowledgments The authors would like to acknowledge the financial support of FAPEMIG (Fundação de Amparo à Pesquisa do Estado de Minas Gerais) and CNPq (Conselho Nacional de Desenvolvimento Científico  ... 
doi:10.1007/978-3-540-77457-0_31 fatcat:soaujjisvvcnrlpkjfhpcs7fyy

Robot Navigation in Multi-terrain Outdoor Environments

Guilherme A. S. Pereira, Luciano C. A. Pimenta, Alexandre R. Fonseca, Leonardo de Q. Corrêa, Renato C. Mesquita, Luiz Chaimowicz, Daniel S. C. de Almeida, Mario F. M. Campos
2009 The international journal of robotics research  
This paper presents a methodology for motion planning in outdoor environments that takes into account specific characteristics of the terrain.  ...  After decomposing the map into triangular cells, a path planning algorithm is used to determine a discrete sequence of cells that minimizes the navigation cost.  ...  Acknowledgments The authors would like to acknowledge the financial support of FAPEMIG (Fundação de Amparo à Pesquisa do Estado de Minas Gerais) and CNPq (Conselho Nacional de Desenvolvimento Científico  ... 
doi:10.1177/0278364908097578 fatcat:kolw2quu3bf3jhu3hazdflicmm

AIE volume 23 issue 3 Cover and Back matter

2009 Artificial intelligence for engineering design, analysis and manufacturing  
Suitable topics include, but are not limited to, the following: † models, techniques, or systems, both human-centered and computational, for (supporting) biologically inspired design (including biomimetics  ...  Although papers with normal AI content are desired for this Special Issue, we broaden the scope to also include papers that provide knowledge and associated methodology for design pedagogy.  ...  The ever increasing range of real-world applications triggers the demand to extend existing configurator functionalities.  ... 
doi:10.1017/s0890060409009949 fatcat:4wfxkio73rbyzennyscsvljdo4
« Previous Showing results 1 — 15 out of 37,908 results