Author:
Arkin Esther M.,Mitchell Joseph S.B.,Polishchuk Valentin
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference36 articles.
1. J. Canny, J.H. Reif, New lower bound techniques for robot motion planning problems, in: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., 1987, pp. 49–60
2. Geometric shortest paths and network optimization;Mitchell,2000
3. Time-expanded decision networks: A framework for designing evolvable complex systems;Silver;Syst. Eng.,2007
4. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
5. Maximal flow through a domain;Strang;Math. Program.,1983
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Thick non-crossing paths in a polygonal domain;OPTIM LETT;2015
2. On the Complexity of an Unregulated Traffic Crossing;Lecture Notes in Computer Science;2015
3. Optimal Geometric Flows via Dual Programs;Proceedings of the thirtieth annual symposium on Computational geometry;2014-06-08
4. Deterministic Decision Making;Intelligent Systems, Control and Automation: Science and Engineering;2014
5. Sweeping a terrain by collaborative aerial vehicles;Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2013-11-05