点击切换搜索课件文库搜索结果(990)
文档格式:PDF 文档大小:70.87KB 文档页数:8
Massachusetts Institute of Technology 16.412/6.834 Cognitive Robotics Distributed: Monday, 3/31/04 Objective The purpose of the following handout is to walk you step by step through the execution of the FF planning algorithm, on a simple example. The FF algorithm is presented in the paper:
文档格式:PDF 文档大小:592.18KB 文档页数:90
Outline Model-based programming The need for model-based reactive planning The Burton model-based reactive planner Artificial Intelligence Space Systems
文档格式:PDF 文档大小:22.37KB 文档页数:3
Vision-based SLAM Mobile Robot Localization And Mapping With Uncertainty using Scale-Invariant Visual Landmarks -e,lowe, Little Vikash Mansinghka Spren Riisgaard Outline
文档格式:PDF 文档大小:2.64MB 文档页数:21
Defining problem and model so| ution: Minimizing localization error Comb imize gain in explored map bined Information Utilities Integrated Adaptive Information-based Exploration Algorithm
文档格式:PPT 文档大小:6.76MB 文档页数:78
模块六数控电火花线切割机床与操作 数控电火花线切割机床认识项目→ 项目一数控电火花线切割机床加工特点→ 项目二数控电火花线切割机床分类→ 项目三数控电火花线切割机床工艺范围→ 项目四数控电火花线切割机床主要技术参数→ 数控电火花线切割机床了解项目→ 项目一数控电火花线切割机床基本组成→ 项目二坐标工作台→ 项目三走丝机构→
文档格式:PDF 文档大小:91.6KB 文档页数:6
Partially Observable Markov Decision Processes Part II Additional reading: Anthony R. Cassandra. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. Ph. D. Thesis. Brown University Department of Computer Science, Providence, RI
文档格式:PDF 文档大小:985.76KB 文档页数:55
Review: Constraint-based Interval Planning Simple Temporal Networks Schedulability and Scheduling Review: Temporal, Model-based Programming Managing Execution Uncertainty Execution with Dynamic Scheduling Execution with Explicit Models of Uncertainty
文档格式:PDF 文档大小:256.54KB 文档页数:22
Outline Lightning Summary Black Box Model of SIFT SLAM Vision System Challenges in Computer Vision What these challenges mean for visual SLAM How SIFT extracts candidate landmarks How landmarks are tracked in SIFT SLAM Alternative vision-based SLAM systems Open questions
文档格式:PDF 文档大小:963.71KB 文档页数:12
Leslie Pack Kaelbling, Michael. Littman and Anthony R. Cassandra, \Planning and Acting in Partially Observable Stochastic Domains,\ Artificial Intelligence, Vol. 101, 1998. j. Pineau,g. Gordon&s. Thrun\Point-based- value iteration: An anytime algorithm for POMDPs\. International Joint Conference on Artificial Intelligence(JCAI) Acapulco, Mexico. Aug
文档格式:PDF 文档大小:121.32KB 文档页数:26
Fast Solutions to CSp's Based on PROSSER, P. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence
首页上页6263646566676869下页末页
热门关键字
搜索一下,找到相关课件或文库资源 990 个  
©2008-现在 cucdc.com 高等教育资讯网 版权所有