984 resultados para MOBILE ROBOTICS
Resumo:
Meng, Q., & Lee, M. (2005). Novelty and Habituation: the Driving Forces in Early Stage Learning for Developmental Robotics. Wermter, S., Palm, G., & Elshaw, M. (Eds.), In: Biomimetic Neural Learning for Intelligent Robots: Intelligent Systems, Cognitive Robotics, and Neuroscience. (pp. 315-332). (Lecture Notes in Computer Science). Springer Berlin Heidelberg.
Resumo:
Q. Meng and M. H. Lee, Novelty and Habituation: the Driving Forces in Early Stage Learning for Developmental Robotics, AI-Workshop on NeuroBotics, University of Ulm, Germany. September 2004.
Resumo:
Q. Meng and M. H. Lee, Learning and Control in Assistive Robotics for the Elderly, IEEE Conference on Robotics, Automation and Mechatronics (RAM), Singapore, 2004.
Resumo:
Q. Meng and M. H. Lee, Design Issues for Assistive Robotics for the Elderly, IARP / IEEE-RAS / Euron Workshop on Dependable Robots in Human Environments, Manchester, 2004.
Resumo:
Meng Q. and Lee M.H., Behaviour-Based Assistive Robotics for the Home, in Proc. SMC2001, IEEE 2001 Int. Conf. on Systems, Man and Cybernetics, Tucson, Arizona, Oct 2001, pp684-689.
Resumo:
Draper, J., Darby, R.M., Beckmann, M., Maddison, A.L., Mondhe, M., Sheldrick, C., Taylor, J., Goodacre, R., and Kell, D.B. (2002) Metabolic Engineering, metabolite profiling and machine learning to investigate the phloem-mobile signal in systemic acquired resistance in tobacco. First International Congress on Plant Metabolomics, Wageningen, The Netherlands
Resumo:
Walker,J. and Wilson,M.S., 'How Useful is Lifelong Evolution for Robotics', Proceedings of the 7th International Conference on Simulation of Adaptive Behaviour, ed Hallam,B. and Floreano,D. and Hallam,J. and Hayes,G. and Meyer,J.A., pp 347-348, 2002, MIT Press
Resumo:
M.H. Lee, Q. Meng and F. Chao, 'Staged Competence Learning in Developmental Robotics', Adaptive Behavior, 15(3), pp 241-255, 2007. the full text will be available in September 2008
Resumo:
M.H. Lee, Q. Meng and F. Chao, 'A Content-Neutral Approach for Sensory-Motor Learning in Developmental Robotics', EpiRob'06: Sixth International Conference on Epigenetic Robotics, Paris, 55-62, 2006.
Resumo:
Q. Meng and M.H. Lee, 'Design issues for Assistive Robotics for the Elderly', Advanced Engineering Informatics, 20(2), pp 171-186, 2006.
Resumo:
Lee, M.H., Intelligent Robotics, 224pp, Chapman and Hall, 1990.
Resumo:
We discuss the design principles of TCP within the context of heterogeneous wired/wireless networks and mobile networking. We identify three shortcomings in TCP's behavior: (i) the protocol's error detection mechanism, which does not distinguish different types of errors and thus does not suffice for heterogeneous wired/wireless environments, (ii) the error recovery, which is not responsive to the distinctive characteristics of wireless networks such as transient or burst errors due to handoffs and fading channels, and (iii) the protocol strategy, which does not control the tradeoff between performance measures such as goodput and energy consumption, and often entails a wasteful effort of retransmission and energy expenditure. We discuss a solution-framework based on selected research proposals and the associated evaluation criteria for the suggested modifications. We highlight an important angle that did not attract the required attention so far: the need for new performance metrics, appropriate for evaluating the impact of protocol strategies on battery-powered devices.
Resumo:
Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance.
Resumo:
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited cache sizes at the sensor nodes, the goal is to develop a distributed cache management algorithm to efficiently answer queries with a known probability distribution over the spatial dimension. First, we propose a novel distributed information theoretic approach in which the nodes locally update their caches based on full knowledge of the space-time distribution of the monitored phenomenon. At each time instant, local decisions are made at the mobile nodes concerning which samples to keep and whether or not a new sample should be acquired at the current location. These decisions account for minimizing an entropic utility function that captures the average amount of uncertainty in queries given the probability distribution of query locations. Second, we propose a different correlation-based technique, which only requires knowledge of the second-order statistics, thus relaxing the stringent constraint of having a priori knowledge of the query distribution, while significantly reducing the computational overhead. It is shown that the proposed approaches considerably improve the average field estimation error by maintaining efficient cache content. It is further shown that the correlation-based technique is robust to model mismatch in case of imperfect knowledge of the underlying generative correlation structure.
Resumo:
The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: the often resource-limited nature of these platforms, and the necessity of preserving the autonomy of the owner of these devices. These challenges preclude using centralized control and preclude considering services that are subject to performance guarantees. To that end, this thesis advances a number of new distributed resource management techniques that are shown to be effective in such settings, focusing on two application domains: distributed Field Monitoring Applications (FMAs), and Message Delivery Applications (MDAs). In the context of FMA, this thesis presents two techniques that are well-suited to the fairly limited storage and power resources of autonomously mobile sensor nodes. The first technique relies on amorphous placement of sensory data through the use of novel storage management and sample diffusion techniques. The second approach relies on an information-theoretic framework to optimize local resource management decisions. Both approaches are proactive in that they aim to provide nodes with a view of the monitored field that reflects the characteristics of queries over that field, enabling them to handle more queries locally, and thus reduce communication overheads. Then, this thesis recognizes node mobility as a resource to be leveraged, and in that respect proposes novel mobility coordination techniques for FMAs and MDAs. Assuming that node mobility is governed by a spatio-temporal schedule featuring some slack, this thesis presents novel algorithms of various computational complexities to orchestrate the use of this slack to improve the performance of supported applications. The findings in this thesis, which are supported by analysis and extensive simulations, highlight the importance of two general design principles for distributed systems. First, a-priori knowledge (e.g., about the target phenomena of FMAs and/or the workload of either FMAs or DMAs) could be used effectively for local resource management. Second, judicious leverage and coordination of node mobility could lead to significant performance gains for distributed applications deployed over resource-impoverished infrastructures.