ACM Home Page
Please provide us with feedback. Feedback
A probabilistic language based upon sampling functions
Full text PdfPdf (282 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Long Beach, California, USA
Pages: 171 - 182  
Year of Publication: 2005
ISBN:1-58113-830-X
Also published in ...
Authors
Sungwoo Park  Carnegie Mellon University
Frank Pfenning  Carnegie Mellon University
Sebastian Thrun  Stanford University
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 68,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1040305.1040320
What is a DOI?

ABSTRACT

As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primitive datatypes. Most probabilistic languages, however, focus only on discrete distributions and have limited expressive power. In this paper, we present a probabilistic language, called λο, which uniformly supports all kinds of probability distributions -- discrete distributions, continuous distributions, and even those belonging to neither group. Its mathematical basis is sampling functions, i.e., mappings from the unit interval (0.0,1.0] to probability domains.We also briefly describe the implementation of λο as an extension of Objective CAML and demonstrate its practicality with three applications in robotics: robot localization, people tracking, and robotic mapping. All experiments have been carried out with real robots.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
A. Doucet, N. de Freitas, and N. Gordon. Sequential Monte Carlo Methods in Practice. Springer Verlag, New York, 2001.
 
4
D. Fox, W. Burgard, and S. Thrun. Markov localization for mobile robots in dynamic environments. Journal of Artificial Intelligence Research, 11:391--427, 1999.
 
5
J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675--695, Dec. 1977.
 
6
M. Giry. A categorical approach to probability theory. In B. Banaschewski, editor, Categorical Aspects of Topology and Analysis, pages 68--85. Springer Verlag, 1981.
7
 
8
M. Henrion. Propagation of uncertainty in Bayesian networks by probabilistic logic sampling. In J. F. Lemmer and L. N. Kanal, editors, Uncertainty in Artificial Intelligence 2, pages 149--163. Elsevier/North-Holland, 1988.
 
9
A. H. Jazwinski. Stochastic Processes and Filtering Theory. Academic Press, New York, 1970.
 
10
 
11
D. Koller, D. McAllester, and A. Pfeffer. Effective Bayesian inference for stochastic programs. In AAAI-97/IAAI-97, pages 740--747. AAAI Press, 1997.
 
12
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
 
13
 
14
P. Martin-Löf. On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic, 1(1):11--60, 1996.
 
15
 
16
 
17
 
18
M. Montemerlo, N. Roy, and S. Thrun. CARMEN: Carnegie mellon robot navigation toolkit. http://www.cs.cmu.edu/~carmen/.
 
19
M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit. FastSLAM 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges. In IJCAI-03. Morgan Kaufmann Publishers, Inc., 2003.
 
20
M. Montemerlo, W. Whittaker, and S. Thrun. Conditional particle filters for simultaneous mobile robot localization and people-tracking. In IEEE International Conference on Robotics and Automation (ICRA), 2002.
21
 
22
S. Park, F. Pfenning, and S. Thrun. A probabilistic language based upon sampling functions. Technical Report CMU-CS-04-173, School of Computer Science, Carnegie Mellon University, 2004.
 
23
A. Pfeffer. IBAL: A probabilistic rational programming language. In IJCAI-01, pages 733--740. Morgan Kaufmann Publishers, 2001.
 
24
 
25
26
 
27
 
28
N. Saheb-Djahromi. Probabilistic LCF. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science, volume~64 of LNCS, pages 442--451. Springer, 1978.
 
29
S. Thrun. Probabilistic algorithms in robotics. AI Magazine, 21(4):93--109, 2000.
 
30
S. Thrun. Towards programming tools for robots that integrate probabilistic computation and learning. In ICRA-00. IEEE, 2000.
 
31
 
32


Collaborative Colleagues:
Sungwoo Park: colleagues
Frank Pfenning: colleagues
Sebastian Thrun: colleagues