On-Line Algorithms for Robot Navigation and Server Problems
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. The robot localization problem in two dimensions , 1992, SODA '92.
[2] R. Rivest,et al. Piecemeal Learning of an Unknown Environment , 1993, COLT '93.
[3] Manuel Blum,et al. On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[4] Edward F. Grove. The harmonic online K-server algorithm is competitive , 1991, STOC '91.
[5] Philip S. Yu,et al. Scheduling parallel tasks to minimize average response time , 1994, SODA '94.
[6] Allan Borodin,et al. Competitive paging with locality of reference , 1991, STOC '91.
[7] Marek Chrobak,et al. The Server Problem and On-Line Games , 1991, On-Line Algorithms.
[8] C. N. Shen,et al. Autonomous navigation to provide long-distance surface traverses for Mars Rover Sample Return Mission , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.
[9] J. R. Isbell. An optimal search pattern , 1957 .
[10] A. Mishkin,et al. Autonomous Navigation and Control of a Mars Rover , 1989 .
[11] Rolf Klein. Walking an Unknown Street with Bounded Detour , 1991, Comput. Geom..
[12] Jeffrey Shallit. A Minimization Problem , 1994, SIAM Rev..
[13] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.
[14] Mona Singh,et al. Piecemeal learning of an unknown environment , 1995, Mach. Learn..
[15] Marek Chrobak,et al. A New Approach to the Server Problem , 1991, SIAM J. Discret. Math..
[16] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[17] Michael Drumheller,et al. Mobile Robot Localization Using Sonar , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[18] Prabhakar Raghavan,et al. Random walks on weighted graphs, and applications to on-line algorithms , 1990, STOC '90.
[19] Sandy Irani,et al. A Competitive 2-Server Algorithm , 1991, Inf. Process. Lett..
[20] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..
[21] Marek Chrobak,et al. An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..
[22] Makoto Imase,et al. Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..
[23] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[24] Christos H. Papadimitriou,et al. On the k-server conjecture , 1995, JACM.
[25] O. Ore. Theory of Graphs , 1962 .
[26] Ming-Yang Kao,et al. Optimal constructions of hybrid algorithms , 1994, SODA '94.
[27] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..
[28] Gerard Hanley,et al. The Placement and Misplacement of You-Are-Here Maps , 1984 .
[29] Magnús M. Halldórsson,et al. Lower bounds for on-line graph coloring , 1992, SODA '92.
[30] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[31] Sundar Vishwanathan. Randomized Online Graph Coloring , 1992, J. Algorithms.
[32] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[33] Gregory Dudek,et al. Localizing a robot with minimum travel , 1995, SODA '95.
[34] Chih-Ming Wang. Location Estimation and Uncertainty Analysis for Mobile Robots , 1990, Autonomous Robot Vehicles.
[35] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[36] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[37] M. Goldberg. A Minimization Problem , 1981 .
[38] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[39] Bruce Randall Donald,et al. On Information Invariants in Robotics , 1995, Artif. Intell..
[40] Baruch Schieber,et al. Navigating in unfamiliar geometric terrain , 1991, STOC '91.
[41] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[42] Larry S. Davis,et al. Computational ground and airborne localization over rough terrain , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[43] H. A. Kierstead,et al. The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..
[44] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[45] Noga Alon,et al. On-line steiner trees in the Euclidean plane , 1992, SCG '92.
[46] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.
[47] Yossi Azar,et al. Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.
[48] C. M. Wang,et al. Location estimation and uncertainty analysis for mobile robots , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[49] Yuval Rabani,et al. Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[50] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[51] Michael Saksl. Lattices, MEbius Functions and Communication Complexity , 1988 .
[52] Jon M. Kleinberg,et al. On-line search in a simple polygon , 1994, SODA '94.
[53] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[54] Amos Fiat,et al. On-Line Navigation in a Room , 1992, SODA.
[55] Jay Gowdy,et al. Annotated maps for autonomous land vehicles , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.
[56] Avrim Blum,et al. An on-line algorithm for improving performance in navigation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[57] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[58] Marek Chrobak,et al. On Fast Algorithms for Two Servers , 1991, J. Algorithms.
[59] Ingemar J. Cox,et al. Blanche-an experiment in guidance and navigation of an autonomous robot vehicle , 1991, IEEE Trans. Robotics Autom..
[60] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[61] Yuval Rabani,et al. Competitive k-server algorithms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[62] Ming-Yang Kao,et al. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.
[63] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.