@conference {16421,
	title = {GoGoBot: group collaboration, multi-agent modeling, and robots},
	booktitle = {Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers},
	series = {AAMAS {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {1715 - 1716},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Richland, SC},
	abstract = {Multi-agent simulation is a powerful technique used to encode real-world simple rules in virtual agents and then simulate their interactions [1]. Participatory simulations are similar to multi-agent simulation except individuals play the role of virtual agents, sometimes in combination with these virtual agents [2]. Finally, the bifocal modeling framework has enabled the examination of agents embodied in physical entities using sensors and actuators [3]. All three of these technologies are concerned with the creation, manipulation, and development of agents in one form or another. Thus combining these three disparate systems in to one unified platform would be useful. Multi-agent simulation platforms, participatory simulations, and bifocal modeling have all been demonstrated separately in the past. However many extant systems are difficult if not impossible to integrate.},
	keywords = {multi-agent simulation, participatory simulation, ROBOTICS},
	url = {http://dl.acm.org/citation.cfm?id=1402744.1402780},
	author = {Rand, William and Blikstein,Paulo and Wilensky,Uri}
}
@conference {16429,
	title = {Participatory, embodied, multi-agent simulation},
	booktitle = {Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems},
	series = {AAMAS {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {1457 - 1458},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We will demonstrate the integration of a software-based multi-agent modeling platform with a participatory simulation environment and real-time control over a physical agent (robot). Both real and virtual participants will be able to act as agents in a simulation that will control a physical agent. The backbone of this demonstration is a widely used, freely available, mature modeling platform known as NetLogo.},
	keywords = {embedded agents, multi-agent simulation, participatory simulation, ROBOTICS, Sensors},
	isbn = {1-59593-303-4},
	doi = {10.1145/1160633.1160913},
	url = {http://doi.acm.org/10.1145/1160633.1160913},
	author = {Blikstein,Paulo and Rand, William and Wilensky,Uri}
}
@conference {14235,
	title = {New eyes for robotics},
	booktitle = {2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings},
	volume = {1},
	year = {2003},
	month = {2003/10/27/31},
	pages = {1018- 1023 vol.1 - 1018- 1023 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper describes an imaging system that has been designed to facilitate robotic tasks of motion. The system consists of a number of cameras in a network arranged so that they sample different parts of the visual sphere. This geometric configuration has provable advantages compared to small field of view cameras for the estimation of the system{\textquoteright}s own motion and consequently the estimation of shape models from the individual cameras. The reason is that inherent ambiguities of confusion between translation and rotation disappear. Pairs of cameras may also be arranged in multiple stereo configurations which provide additional advantages for segmentation. Algorithms for the calibration of the system and the 3D motion estimation are provided.},
	keywords = {3D motion estimation, Argus eye, array signal processing, Birds, Calibration, CAMERAS, Control systems, Eyes, geometric configuration, imaging, imaging system, Layout, Motion estimation, multiple stereo configurations, Robot kinematics, robot vision, Robot vision systems, ROBOTICS, Robotics and automation, SHAPE, shape models},
	isbn = {0-7803-7860-1},
	doi = {10.1109/IROS.2003.1250761},
	author = {Baker, P. and Ogale, A. S and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {13938,
	title = {Designing PETS: a personal electronic teller of stories},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit},
	series = {CHI {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {326 - 329},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We have begun the development of a new robotic pet that cansupport children in the storytelling process. Children can build
their own pet by snapping together the modular animal parts of the
PETS robot. After their pet is built, children can tell
stories using the My Pets software. These stories can
then be acted out by their robotic pet. This video paper describes
the motivation for this research and the design process of our
intergenerational design team in building the first PETS
prototypes. We will discuss our progress to date and our focus for
the future.
},
	keywords = {children, cooperative inquiry, design techniques, educational applications, intergenerational design team, PETS, ROBOTICS},
	isbn = {0-201-48559-1},
	doi = {10.1145/302979.303103},
	url = {http://doi.acm.org/10.1145/302979.303103},
	author = {Druin, Allison and Montemayor,Jamie and Hendler,Jim and McAlister,Britt and Boltman,Angela and Fiterman,Eric and Plaisant,Aurelie and Kruskal,Alex and Olsen,Hanne and Revett,Isabella and Schwenn,Thomas Plaisant and Sumida,Lauren and Wagner,Rebecca}
}
@article {11922,
	title = {MARUTI at ARDEC.},
	year = {1996},
	month = {1996/07/11/},
	institution = {University of Maryland, College Park},
	abstract = {This is the final report of the effort undertaken at the University of Maryland, sponsored by DARPA under the DSSA (Domain Specific Software Architectures) program. The activities reported here required an active cooperation and collaboration of the US Army ARDEC (Automation and Robotics Laboratory) and the University of Maryland (Computer Science Department). The principal investigators have been developing a hard real time operating system, MARUTI, at the University of Maryland. The goal of this effort was to demonstrate the applicability and usefulness of this operating system for exercising PID control at high frequency on the ATB1000 testbed which has been used to simulate a gun turret. A MARUTI based PID controller which operates at 200 HZ and 400 HZ was successfully implemented to demonstrate this feasibility.},
	keywords = {*OPERATING SYSTEMS(COMPUTERS), Computer architecture, COMPUTER PROGRAMMING AND SOFTWARE, CONTROL, Cooperation, DSSA(DOMAIN SPECIFIC SOFTWARE ARCHITECTURE), GUN TURRETS., HIGH FREQUENCY, Laboratories, REAL TIME, ROBOTICS, TEST BEDS},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA315086},
	author = {Agrawala, Ashok K. and Tripathi,Satish K}
}
@article {15671,
	title = {On Finding Shortest Paths on Convex Polyhedra.},
	year = {1985},
	month = {1985/05//},
	institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK},
	abstract = {Applications in robotics and autonomous navigation have motivated the study of motion planning and obstacle avoidance algorithms. The special case considered here is that of moving a point (the object) along the surface of a convex polyhedron (the obstacle) with n vertices. Sharir and Schorr have developed an algorithm that, given a source point on the surface of a convex polyhedron, determines the shortest path from the source to any point on the polyhedron in linear time after O(n cubed log n) preprocessing time. The preprocessed output requires O(n squared) space. By using known algorithms for fast planar point location, the shortest path query time for Sharir and Schorr{\textquoteright}s algorithm is shown to be O(k + log n) where k is the number faces traversed by the path. We give an improved preprocessing algorithm that runs in O(n squared log n) time requiring the same query time and space. We also show how to store the output of the preprocessing algorithm in O(n log n) space while maintaining the same query time. (Author)},
	keywords = {*ALGORITHMS, *POLYGONS, *Polyhedrons, *PREPROCESSING, AUTONOMOUS NAVIGATION, AVOIDANCE., BARRIERS, INTERROGATION, MOTION, output, PATHS, PE61102F, planning, POSITION(LOCATION), ROBOTICS, THEORETICAL MATHEMATICS, TIME},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA166246},
	author = {Mount, Dave}
}
