Sökning: "automated planning"
Visar resultat 16 - 20 av 96 avhandlingar innehållade orden automated planning.
16. Automated static code analysis : A tool for early vulnerability detection
Sammanfattning : Software vulnerabilities are added into programs during its development. Architectural flaws are introduced during planning and design, while implementation faults are created during coding. Penetration testing is often used to detect these vulnerabilities. LÄS MER
17. On Provably Correct Decision-Making for Automated Driving
Sammanfattning : The introduction of driving automation in road vehicles can potentially reduce road traffic crashes and significantly improve road safety. Automation in road vehicles also brings several other benefits such as the possibility to provide independent mobility for people who cannot and/or should not drive. LÄS MER
18. Semi-Automating Forestry Machines : Motion Planning, System Integration, and Human-Machine Interaction
Sammanfattning : The process of forest harvesting is highly mechanized in most industrialized countries, with felling and processing of trees performed by technologically advanced forestry machines. However, the maneuvering of the vehicles through the forest as well as the control of the on-board hydraulic boom crane is currently performed through continuous manual operation. LÄS MER
19. Spatial distribution and conservation planning of seabed biological diversity
Sammanfattning : Knowledge of spatial patterns of biota has become a commodity for conservation practitioners and spatial ecologists alike. This type of information enables the identification of representative and unique biological features (at some nominal scale) which itself constitutes the application par excellence of knowledge of biodiversity distribution as it relates to the design of reserve networks and the realization of spatial planning. LÄS MER
20. Deductive Planning and Composite Actions in Temporal Action Logic
Sammanfattning : Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. LÄS MER