|
Ant Robotics
Ant robotics is a special case of swarm robotics. Swarm robots are simple (and hopefully, therefore cheap) robots with limited sensing and computational capabilities. This makes it feasible to deploy teams of swarm robots and take advantage of the resulting fault tolerance and parallelism. Swarm robots cannot use conventional planning methods due to their limited sensing and computational capabilities. Thus, their behavior is often driven by local interactions. Ant robots are swarm robots that can communicate via markings, similar to ants that lay and follow pheromone trails. Some ant robots use long-lasting trails (either regular trails of a chemical substance or smart trails of transceivers). Others use short-lasting trails including heat and alcohol. Others even use virtual trails. Invention In 1991, American electrical engineer James McLurkin was the first to conceptualize the idea of "robot ants" while working at the MIT Computer Science and Artificial Intelligence Laboratory a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Swarm Robotics
Swarm robotics is an approach to the coordination of multiple robots as a system which consist of large numbers of mostly simple physical robots. ″In a robot swarm, the collective behavior of the robots results from local interactions between the robots and between the robots and the environment in which they act.″ It is supposed that a desired collective behavior emerges from the interactions between the robots and interactions of robots with the environment. This approach emerged on the field of artificial swarm intelligence, as well as the biological studies of insects, ants and other fields in nature, where swarm behaviour occurs. Definition The research of swarm robotics is to study the design of robots, their physical body and their controlling behaviours. It is inspired but not limited by the emergent behaviour observed in social insects, called swarm intelligence. Relatively simple individual rules can produce a large set of complex swarm behaviours. A key compone ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formicarium
A formicarium or ant farm is a vivarium which is designed primarily for the study of ant colonies and how ants behave. Those who study ant behavior are known as myrmecologists. History The formicarium was invented by Charles Janet, a French entomologist and polymath, who had the idea of reducing the three dimensions of an ant nest to the virtual two dimensions between two panes of glass. His design was exhibited in the Exposition Universelle (1900) in Paris. Janet's invention was recognized by his promotion to Chevalier (Knight) of the Legion of Honour, but he did not obtain a patent for, nor attempt to market his creation. The first commercially sold formicarium was introduced around 1929 by Frank Eugene Austin (1873–1964), an inventor and professor at the Thayer School of Engineering at Dartmouth College. Austin received a patent for his formicarium on June 16, 1931, as well as further patents for its continued development. Austin included whimsical painted or wooden sce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Inventions ...
The following articles cover the timeline of United States inventions: *Timeline of United States inventions (before 1890), before the turn of the century * Timeline of United States inventions (1890–1945), before World War II *Timeline of United States inventions (1946–1991), for the post-war era *Timeline of United States inventions (after 1991), after the Fall of the Soviet Union {{DEFAULTSORT:Timeline of United States Inventions United States inventions United States The United States of America (U.S.A. or USA), commonly known as the United States (U.S. or US) or America, is a country primarily located in North America. It consists of 50 states, a federal district, five major unincorporated territorie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ant Colony Optimization
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. As an example, ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly recor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Swarm Intelligence
Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. The expression was introduced by Gerardo Beni and Jing Wang in 1989, in the context of cellular robotic systems. SI systems consist typically of a population of simple agents or boids interacting locally with one another and with their environment.Hu, J.; Turgut, A.; Krajnik, T.; Lennox, B.; Arvin, F.,Occlusion-Based Coordination Protocol Design for Autonomous Robotic Shepherding Tasks IEEE Transactions on Cognitive and Developmental Systems, 2020. The inspiration often comes from nature, especially biological systems. The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the emergence of "intelligent" global behavior, unknown to the individual a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Analysis
Stochastic calculus is a branch of mathematics that operates on stochastic processes. It allows a consistent theory of integration to be defined for integrals of stochastic processes with respect to stochastic processes. This field was created and started by the Japanese people, Japanese mathematician Kiyoshi Itô during World War II. The best-known stochastic process to which stochastic calculus is applied is the Wiener process (named in honor of Norbert Wiener), which is used for modeling Brownian motion as described by Louis Bachelier in 1900 and by Albert Einstein in 1905 and other physical diffusion processes in space of particles subject to random forces. Since the 1970s, the Wiener process has been widely applied in financial mathematics and economics to model the evolution in time of stock prices and bond interest rates. The main flavours of stochastic calculus are the Itô calculus and its variational relative the Malliavin calculus. For technical reasons the Itô inte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heuristic
A heuristic (; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediate, short-term goal or approximation. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution. Heuristics can be mental shortcuts that ease the cognitive load of making a decision. Examples that employ heuristics include using trial and error, a rule of thumb or an educated guess. Heuristics are the strategies derived from previous experiences with similar problems. These strategies depend on using readily accessible, though loosely applicable, information to control problem solving in human beings, machines and abstract issues. When an individual applies a heuristic in practice, it generally performs as expected. However it can alternatively cre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simultaneous Localization And Mapping
Simultaneous localization and mapping (SLAM) is the computational problem of constructing or updating a map of an unknown environment while simultaneously keeping track of an agent's location within it. While this initially appears to be a chicken-and-egg problem, there are several algorithms known for solving it in, at least approximately, tractable time for certain environments. Popular approximate solution methods include the particle filter, extended Kalman filter, covariance intersection, and GraphSLAM. SLAM algorithms are based on concepts in computational geometry and computer vision, and are used in robot navigation, robotic mapping and odometry for virtual reality or augmented reality. SLAM algorithms are tailored to the available resources and are not aimed at perfection but at operational compliance. Published approaches are employed in self-driving cars, unmanned aerial vehicles, autonomous underwater vehicles, planetary rovers, newer domestic robots and even inside ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probabilistic Reasoning
Probabilistic logic (also probability logic and probabilistic reasoning) involves the use of probability and logic to deal with uncertain situations. Probabilistic logic extends traditional logic truth tables with probabilistic expressions. A difficulty of probabilistic logics is their tendency to multiply the computational complexities of their probabilistic and logical components. Other difficulties include the possibility of counter-intuitive results, such as in case of belief fusion in Dempster–Shafer theory. Source trust and epistemic uncertainty about the probabilities they provide, such as defined in subjective logic, are additional elements to consider. The need to deal with a broad variety of contexts and issues has led to many different proposals. Logical background There are numerous proposals for probabilistic logics. Very roughly, they can be categorized into two different classes: those logics that attempt to make a probabilistic extension to logical entailment, s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robotic Mapping
Robotic mapping is a discipline related to computer vision and cartography. The goal for an autonomous robot is to be able to construct (or use) a map (outdoor use) or floor plan (indoor use) and to localize itself and its recharging bases or beacons in it. Robotic mapping is that branch which deals with the study and application of ability to localize itself in a map / plan and sometimes to construct the map or floor plan by the autonomous robot. Evolutionarily shaped blind action may suffice to keep some animals alive. For some insects for example, the environment is not interpreted as a map, and they survive only with a triggered response. A slightly more elaborated navigation strategy dramatically enhances the capabilities of the robot. Cognitive maps enable planning capacities and use of current perceptions, memorized events, and expected consequences. Operation The robot has two sources of information: the idiothetic and the allothetic sources. When in motion, a robot ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robots
"\n\n\n\n\nThe robots exclusion standard, also known as the robots exclusion protocol or simply robots.txt, is a standard used by websites to indicate to visiting web crawlers and other web robots which portions of the site they are allowed to visit.\n\nThis relies on voluntary compliance. Not all robots comply with the standard; email harvesters, spambots, malware and robots that scan for security vulnerabilities may even start with the portions of the website where they have been told to stay out.\n\nThe \"robots.txt\" file can be used in conjunction with sitemaps, another robot inclusion standard for websites.\n History\nThe standard was proposed by Martijn Koster, when working for Nexor in February 1994\n on the ''www-talk'' mailing list, the main communication channel for WWW-related activities at the time. Charles Stross claims to have provoked Koster to suggest robots.txt, after he wrote a badly-behaved web crawler that inadvertently caused a denial-of-service attack on Kost ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
