基本信息
浏览量:79
职业迁徙
个人简介
I am interested in making robots act purposefully and successfully in a world in which most everything is uncertain. Sensors are noisy, actions are imprecise, and objects are often in the wrong location. Despite such obstacles to purposeful action, there are many tasks that can be accomplished successfully. Humans, animals, and some machines are proof. Providing robots with the ability to operate autonomously and purposefully requires an understanding of how different tasks may be accomplished by different repertoires of actions.
Since about 2002, I have been applying methods from topology to these and related problems. My interest in topology started with the realization that knot invariants could describe the 3D arrangement of protein structures. Subsequently, DARPA launched a big program connecting robotics with topology. That program gave me an opportunity to seek topological parallels to some of the earlier work I had done on planning in the presence of uncertainty. One novel result was the following controllability theorem: A system can reach any state in a graph with control uncertainty if and only if the graph’s strategy complex is homotopic to a sphere of dimension two less than the number of states in the graph.
Recently, I have explored topological perspectives on privacy. One discovery is that homology in relations provides lower bounds on how long an individual can defer de-anonymization. In conjunction with my previous work on strategy complexes, this result shows the manner in which a fully controllable system can obfuscate its strategies and goals.
Since about 2002, I have been applying methods from topology to these and related problems. My interest in topology started with the realization that knot invariants could describe the 3D arrangement of protein structures. Subsequently, DARPA launched a big program connecting robotics with topology. That program gave me an opportunity to seek topological parallels to some of the earlier work I had done on planning in the presence of uncertainty. One novel result was the following controllability theorem: A system can reach any state in a graph with control uncertainty if and only if the graph’s strategy complex is homotopic to a sphere of dimension two less than the number of states in the graph.
Recently, I have explored topological perspectives on privacy. One discovery is that homology in relations provides lower bounds on how long an individual can defer de-anonymization. In conjunction with my previous work on strategy complexes, this result shows the manner in which a fully controllable system can obfuscate its strategies and goals.
研究兴趣
论文共 53 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
semanticscholar(2015)
引用0浏览0引用
0
0
semanticscholar(2011)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn