基本信息
views: 88

Bio
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.
Research Interests
Papers共 36 篇Author StatisticsCo-AuthorSimilar Experts
By YearBy Citation主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
semanticscholar(2015)
Cited0Views0Bibtex
0
0
msra(2002)
Cited30Views0Bibtex
30
0
Shape reconstruction using active tactile sensors (2002)
Cited24Views0EIBibtex
24
0
semanticscholar
Cited25Views0Bibtex
25
0
The International Journal of Robotics Researchno. 7 (2000): 635-635
Load More
Author Statistics
#Papers: 36
#Citation: 2897
H-Index: 23
G-Index: 34
Sociability: 3
Diversity: 2
Activity: 0
Co-Author
Co-Institution
D-Core
- 合作者
- 学生
- 导师
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn