Основы наноелектроники / Основы наноэлектроники / ИДЗ / Книги и монографии / ДНК наномеханические роботы и вычислительные устройства (Попов), 2008, c.210
.pdf130.Hoffmann G.W. A neural network model based on the analogy with the immune system // Journal of Theoretical Biology. 1986. V. 122. P. 33 – 67.
131.Aristotle. Nicomachean Ethics (Third Book).
132.Mele A., Eds. The Philosophy of Action. Oxford University Press, Oxford, 1997.
133.De Giacomo G., Iocchi L., Nardi D., Rosati R. Moving a robot starting from a theory of actions.
134.Peters J., Vijayakumar S., Schaal S. Reinforcement learning for humanoid robotics // Humanoids2003, Third IEEE-RAS International Conference on Humanoid Robots, Karlsruhe, Germany, Sept.29-30, 2003.
135.Ludwig Wittgenstein, Philosophical Investigations §621.
136.Dumm M. Automatische Behandlung von Ausnahmesituationen bei Montagevor angen. Master's thesis, Fakult¨at f¨ur Informatik, Univ. Karlsruhe, 1991.
137.Langle T., Luth T.C., Stopp E., Herzog G., Kamstrup G. KANTRA - A Natural Language Interface for Intelligent Robots // U. Rembold, R. Dillman, L. O. Hertzberger, T. Kanade, eds. Intelligent Autonomous Systems (IAS 4). IOS, Amsterdam, 1995. P.357-364.
138.Luth T.C., Langle T., Herzog G., Stopp E., Rembold U. KANTRA: HumanMachine Interaction for Intelligent Robots Using Natural Language // 3rd IEEE Int. Workshop on Robot and Human Communication, RO-MAN'94. Nagoya, Japan, 1994. P.106-111.
139.Luth T.C., Rembold U. Extensive Manipulation Capabilities and Reliable Behaviour at Autonomous Robot Assembly // Proc. of IEEE Int. Conf. on Robotics and Automation, San Diego, CA, 1994.
140.Langle T., Luth T.C., Stopp E., Herzog G. Natural Language Access to Intelligent Robots: Explaining Automatic Error Recovery // A. M. Ramsay, Eds. Artificial Intelligence: Methodology, Systems, Applications. Amsterdam: IOS, 1996. P.259-267.
141.http://aldebaran-robotics.com
142.Hirai K. Current and future perspective of Honda humamoid robot // Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Grenoble, France: IEEE, New York, NY, USA, 1998. P.500-508.
201
143.Hirai K., Hirose M., Haikawa Y., Takenaka T. The development of Honda humanoid robot // IEEE International Conference on Robotics and Automationp. Leuven, Belgium: IEEE, New York, NY, USA, 1998. P.1321-1326.
144.Schaal S. Is imitation learning the route to humanoid robots? // Trends in Cognitive Sciences. 1999. V.3. P.233-242.
145.Rosenschein S. Plan synthesis: a logical approach // Proc. of the 8th Int. Joint Conf. on Artificial Intelligence. 1981.
146.Schild K. A correspondence theory for terminological logics: Preliminary report // Proceedings of the Twelfth International Joint Conference on Artificial Intelligence
(IJCAI91). 1991. P.466-471.
147.Kozen D., Tiuryn J. Logics of programs // van Leeuwen J., eds. Handbook of
Theoretical Computer Science. Elsevier Science Publishers (NorthHolland),
Amsterdam, 1990. P.790-840.
148.Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts // I. Rival, editor. Ordered sets. Ridel, Dordrecht-Boston, 1982. P.445-470.
149.Birkhoff G. Lattice theory. 3rd edition, Coll. Publ., XXV. American Mathematical Society, Providence, RI, 1967.
150.Barbut M., Monjardet B. Ordre et classification. Hachette, Paris, 1970.
151.Casal A., Yim M. Self-reconfiguration planning for a class of modular robots // Proceedings of SPIE, Sensor Fusion and Decentralized Control in Robotic Systems II. 1999. V.3839. P.246-255.
152.Donald B.R., Xavier P.G., Canny J.F., Reif J.H. Kinodynamic motion planning // Journal of the ACM, 1993. V.40. N5. P.1048-1066,
153.Kotay K., Rus D. Generic distributed assembly and repair algorithms for selfreconfiguring robots // Proc. of IEEE Intl. Conf. on Intelligent Robots and Systems, 2004.
154.Pamecha A., Chiang C., Stein D., Chirikjian G. Design and implementation of metamorphic robots // Proceedings of the 1996 ASME Design Engineering Technical Conference and Computers in Engineering Conference, 1996.
155.Pamecha A., Ebert-Uphoff I., Chirikjian G. Useful metrics for modular robot motion planning // IEEE Trans. Robot. Automat. 1997. P.531–545.
202
156.Rus D., Vona M. Crystalline robots: Self-reconfiguration with unitcompressible modules // Autonomus Robots. 2001. V.10. N1. P.107–124.
157.Reif J.H., Slee S. Asymptotically optimal kinodynamic motion planning for selfreconfigurable robots // Seventh International Workshop on the Algorithmic Foundations of Robotics (WAFR2006), NYC, New York, July 16-18, 2006.
158.Reif J.H., Slee S. Optimal Kinodynamic Motion Planning for Self-Reconfigurable Robots Between Arbitrary 2D Configurations // Robotics: Science and Systems
Conference, Georgia Institute of Technology, Atlanta, GA, June 27-30, 2007.
159.Vassilvitskii S., Suh J., Yim M. A complete, local and parallel reconfiguration algorithm for cube style modular robots // Proc. of the IEEE Int. Conf. on Robotics and Automation, 2002.
160.Vassilvitskii S., Kubica J., Rieffel_E., Suh J., Yim M. On the general recon_guration problem for expanding cube style modular robots // Proceedings of the 2002 IEEE Int. Conference on Robotics and Automation. 2002. P.801-808.
161.Vona M., Rus D. Self-reconfiguration planning with compressible unit modules // 1999 IEEE International Conference on Robotics and Automation, 1999.
162.Walter J., Tsai B., Amato N. Choosing good paths for fast distributed reconfiguration of hexagonal metamorphic robots // Proc. of the IEEE Intl. Conf. on Robotics and Automation, 2002. P.102–109.
163.Walter J.E., Welch J.L., Amato N.M.. Distributed reconfiguration of metamorphic robot chains // PODC ‘00. 2000. P.171–180.
164.Yim M., Duff D., Roufas K. Polybot: A modular reconfigurable robot // ICRA. 2000. P.514-520.
165.Aldakhilallah K. A., Ramesh R. Recognition of minimal feature covers of prismatic objects: a prelude to automated process planning // International Journal of Production Research. 1997. V.35. P.635-650.
166.Reif J., Slee S. Asymptotically Optimal Kinodynamic Motion Planning for Modular Self-Reconfigurable Robots // International Journal of Computational Geometry & Applications. 2008.
203
167.Barraquand J., Latombe J.C. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles // Algorithmica. 1993. V.10. P.121–155.
168.Boissonnat J.D., Bui X.N. Accessibility Region for a Car that Only Moves Forwards along Optimal Paths // Technical report, INRIA, Sophia Antipolis, France, 1994.
169.Boissonnat J.D., Cerezo A., Leblond J. Shortest paths of bounded curvature in the plane // Proceedings of the IEEE International Conference on Robotics and Automation. Nice, France, 1992. P.2315–2320.
170.Boissonnat J.D., Cerezo A., Leblond J. A Note on Shortest Paths in the Plane Subject to a Constraint on the Derivative of the Curvature // Technical report, INRIA, Sophia Antipolis, France, 1994.
171.Bui X.N., Boissonnat J.D., Soueres P., Laumond J.P. Shortest path synthesis for Dubins non-holonomic robot // Proceedings of the IEEE International Conference on Robotics and Automation. San Diego, CA, 1994. P.2–7.
172.Canny J. Some algebraic and geometric configuration in PSPACE // Proc. Annual ACM Sympos. TheoryComput. 1988. V.20. P.460–467.
173.Fraichard T. Smooth trajectory planning for a car in a structured world // Proceedings of the IEEE International Conference on Robotics and Automation. Sacramento, CA, 1991. P.2–7.
174.Jacobs P., Laumond J.P., Taix M. Efficient motion planners for nonholonomic mobile robots // Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems. Osaka, Japan, 1991. P.1229–1235.
175.Kostov V.P., Degtiariova-Kostova E.V. Suboptimal Paths in the Problem of a Planar Motion with Bounded Derivative of the Curvature // Technical report, INRIA, Cedex, France, 1993.
176.Kostov V.P., Degtiariova-Kostova E.V. The Planar Motion with Bounded Derivative of the Curvature and Its Suboptimal Paths, Technical report, INRIA, Cedex, France, 1994.
204
177.Latombe J.C. A fast path-planner for a car-like indoor mobile robot // Proceedings of the Ninth National Conference on Artificial Intelligence. Anaheim, CA, 1991. P.659–665.
178.Laumond J.P. Finding collision free smooth trajectories for a nonholonomic mobile robot // Proc. Internat. Joint Conf. Artificial Intelligence. 1987. V.10. P.1120–
1123.
179.Laumond J.P., Simeon T. Motion Planning for a Two Degrees of Freedom Mobile Robot with Towing // Technical report, LAAS/CNRS, LAAS, Toulouse, France, 1989.
180.Laumond J.P., Taix M., Jacobs P. A motion planner for car-like robots based on a global/local approach // Proc. IEEE/RSJ International Workshop on Intelligent Robots and Systems. Tsuchira, Japan, 1990. P.765–773.
181.Nakamura Y., Mukherjee R. Nonholonomic path planning and automation // Proceedings of the IEEE International Conference on Robotics and Automation. Scottsdale, AZ, 1989. P.1050–1055.
182.Reif J. Complexity of the generalized movers problem // J. Hopcroft, J. Schwartz, and M. Sharir, Eds. Planning, Geometryand Complexity of Robot Motion. Ablex, Norwood, NJ, 1987. P.267–281.
183.Schwartz J.T., Sharir M. Algorithmic motion planning in robotics // J. V. Leeuwen, ed. Algorithms and Complexity. Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, 1990. P.391–430.
184.Wilfong G. Motion planning for an autonomous vehicle // Proceedings of the IEEE International Conference on Robotics and Automation, 1988. P.529–533.
185.Wilfong G. Shortest paths for autonomous vehicles // Proceedings of the IEEE International Conference on Robotics and Automation, 1989. P.15–20.
186.Amato N.M., Bayazit O.B., Dale L.K., Jones C., Vallejo D. OBPRM: An obstaclebased PRM for 3D workspaces // Proc. 3rd Workshop Algorithmic Found. Robot., 1998. P.155–168.
187.Amato N.M., Dill K.A., Song G. Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures // Proc. 6th Annu. Int. Conf. Computat. Biol., 2002. P.2–11.
205
188.Apaydin M.S., Brutlag D.L., Guestrin C., Hsu D., Latombe J.-C. Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion // Proc. 6th Annu. Int. Conf. Computat. Biol., 2002. P.12–21.
189.Barraquand J., Kavraki L.E., Latombe J.-C., Li T., Motwani R., Raghavan P. Arandom sampling scheme for path planning // Int. J. Robot. Res. 1997. V.16. N6. P.759–774.
190.Bohlin R., Kavraki L.E. Path planning using lazy PRM // Proc. IEEE Int. Conf. Robot. Autom., 2000. P.521–528.
191.Boor V., Overmars M.H., van der Stappen A.F. The Gaussian sampling strategy for probabilistic roadmap planners // Proc. IEEE Int. Conf. Robot. Autom., 1999. P.1018–1023.
192.Chang H., Li T.-Y. Assembly maintainability study with motion planning // Proc. IEEE Int. Conf. Robot. Autom., 1995. P.1012–1019.
193.Dale L.K., Amato N.M. Probabilistic roadmaps—Putting it all together // Proc. IEEE Int. Conf. Robot. Autom., 2001. P.1940–1947.
194.Foskey M., Garber M., Lin M.C., Manocha D. A Voronoi-based hybrid motion planner // Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 2001. P.55–60.
195.Hsu D., Latombe J.-C., Motwani R. Path planning in expansive configuration spaces // Int. J. Computat. Geom. Applic. 1999. V.9. N4–5. P.495–512.
196.Kavraki L.E., Svestka P., Latombe J.-C., Overmars M.H. Probabilistic roadmaps for path planning in high-dimensional configuration spaces // IEEE Trans. Robot. Autom. 1996. V.12. N4. P.566–580.
197.LaValle S.M., Kuffner J.J. Randomized kinodynamic planning // Int. J. Robot. Res. 2001. V.20. N5. P.278–400.
198.Lindemann S.R., LaValle S.M. Incremental low-discrepancy lattice methods for motion planning // Proc. IEEE Int. Conf. Robot. Autom., 2003. P.2920–2927.
199.Nissoux C., Simeon T., Laumond J.-P. Visibility-based probabilistic roadmaps // Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., 1999. P.1316–1321.
200.Reif J.H. Complexity of the mover‘s problem and generalizations // Proc. 20th IEEE Symp. Found. Computer Sci., 1979. P.421–427.
206
201.Reif J.H., Sun Z. On frictional mechanical systems and their computational power
//SIAM J. Comput. 2003. V.32. N6. P.1449–1474.
202.Sellen J. Lower bounds for geometrical and physical problems // SIAM J. Comput. 1996. V.25. N6. P.1231–1253.
203.Simeon T., Laumond J.-P., Geem C., Cortes J. Computer-aided motion: Move3D within MOLOG // Proc. IEEE Int. Conf. Robot. Autom., 2001. P.1494–1499.
204.Singh A.P., Latombe J.-C., Brutlag D.L. A motion planning approach to flexible ligand binding // Proc. 7th Int. Conf. Intell. Syst. Molecular Biol., 1999. P.252–261.
205.Berra P. B., Barash M. M. The automated planning and optimization of manufacturing processes // Proc. 1968 IFAC Symposium on Optimal Systems Planning. New York, NY, USA, 1968. P.191-202.
206.Berra P. B., Barash M. M. A computerised algorithm for the planning and optimisation of a manufacturing process // Computer Aided Design. 1971. V.3. P.2428.
207.Fatikow S., Mounassypov R. Assembly sequence planning for manufacturing by microrobots // Proc. 1997 IEEE International Symposium on Assembly and Task Planning (ISATP'97): Towards Flexible and Agile Assembly and Manufacturing. New York, NY, USA, 1997. P.269-274.
208.Kandikjan T., Dukovski V. Automated planning and evaluation of product
assembly sequences // Proc. ThirtyFirst International MATADOR CONFERENCE.
San Mateo, CA, USA, 1995. P.541-548.
209.Gilbert J. Declarative knowledge representation in planning and scheduling // Proc. Third International Conference on Knowledge Representation (KR'92): Principles of Knowledge Representation and Reasoning. San Mateo, CA, USA, 1992. P.3-13.
210.Shanahan M. Robotics and the common sense informatic situation // Wahlster W., editor. Proc. European Conference on Artificial Intelligence. John Wiley and Sons, Ltd, 1996. P.684-688.
211.Sormaz D. N., Khoshnevis B. Knowledge representation for automated process planning // Proc. IEEE International Symposium on Assembly and Task Planning. Los Alamitos, CA, USA, 1995. P.34-39.
207
212.Beer R., Chiel H., Sterling L. Designing Autonomous Agents: Theory and practice from biology to engineering and back. The MIT Press/Bradford Books, Cambridge, MA, 1992.
213.Brooks R. A. A robust layered control system for a mobile robot // IEEE Journal
of Robotics and Automation, RA2, 1986.
214.Chapman D. Vision, instruction and action. The MIT Press, Cambridge, MA, 1992.
215.Connell J. Minimalist mobile robotics: a colonystyle architecture for an artifical
creature. Academic Press, Sand Diego, 1990.
216.Kelly I. D., Keating D. A. Flocking by the fusion of sonar and active infrared sensors on physical autonomous mobile robots // Proc. Mechatronics. 1996. V.96.
217.MacLeod E. N., Chiarella M. Navigation and control breakthrough for automated mobility // Proc. SPIE: The International Society for Optical Engineering. SPIE, 1994. P.57-68.
218.Merkle R. A proposed ''metabolism'' for a hydrocarbon assembler // Nanotechnology. 1997. V.8. P.149-162.
219.Payton D. W., Keirsey D., Krozel D., Rosenblatt K. Do whatever works: a robust
approach to faulttolerant autonomous control // J. Applied Intelligence. 1992. V.3.
P.225.
220.Hunter L. Artificial intelligence and molecular biology. The MIT Press, Cambridge: Massachusetts, 1993.
221.Musgrave C. B., Perry J. K., Merkle R. C., Goddard W. A. Theoretical studies of a hydrogen abstraction tool for nanotechnology. Abstract // Nanotechnology. 1991. V.2. P.187-195.
222.Ratanapan K., Dagli C.H. An objectbased evolutionary algorithm: the nesting
solution // Proc. 1998 IEEE World Congress on Computational Intelligence. Anchorage: Alaska, May 1998. P.581-586.
223. Shankar R. Principles of quantum mechanics. Plenum Press: New York, California: USA, 2nd edition edition, 1994.
208
224. Villarrubia J. S. Algorithms for Scanned Probe Microscope Image Simulation, Surface Reconstruction, and Tip Estimation // J. Res. Natl. Inst. Stand. Technol. 1997. V.102. P.425-454.
209
Заключение
Исследования в области ДНК наномеханических устройств уже сейчас – на этапе разработки таких устройств – требуют активного участия информационных технологий, причем не только как вспомогательного инструмента, но и как источника моделей, архитектурных решений, структур данных, протоколов и т.д. В обозримом будущем ДНК наномеханические устройства имеют неплохие шансы приобрести статус промышленных разработок, что поставит перед информационными технологиями стандартный комплекс эксплуатационных задач. При этом следует отметить, что как и у любой области нанотехнологий, у ДНК наномеханических устройств весьма высока «плата за вход»: необходимы знания по широким облостям молекулярной биологии, физеологии, физики, химии, математики, материаловедения
(не считая информатики). Поэтому эта область исследований нуждается в заблаговременном строительстве информационно-технологического фундамента.
В статье дан обзор современного состояния исследований в области ДНК наномеханических устройств. В частности, обозначены основные тенденции в области разработки устройств с использованием генетического материала. Представлен краткий обзор по материалам и узлам, используемым для конструирования наномеханических устройств. Дан краткий обзор разработанных на сегодняшний день моделей нанороботов. Представлен обзор по компьютерному моделированию биологических наноматериалов, наноустройств и их отдельных узлов на этапе разработки;
компьютерным симуляторам работы наноустройств и поведения наноматериалов.
Рассмотрены модели управление наносистемами. Дан анализ переносимости систем управления традиционными робототехническими комплексами на наносистемы.
Рассмотрены также вопросы из смежных областей, дополняющие картину исследований и позволяющие судить о дальнейших перспективах развития исследований по наномеханическим устройствам.
210