Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Local Minima

Encyclopedia of Artificial Intelligence
It is also known as relative minima. Local minimum refers to a minimum within some neighborhood and it may not be a global minimum.
Published in Chapter:
Mobile Robots Navigation, Mapping, and Localization Part I
Lee Gim Hee (DSO National Laboratories, Singapore) and Marcelo H. Ang Jr. (National University of Singapore, Singapore)
Copyright: © 2009 |Pages: 8
DOI: 10.4018/978-1-59904-849-9.ch158
Abstract
The development of autonomous mobile robots is continuously gaining importance particularly in the military for surveillance as well as in industry for inspection and material handling tasks. Another emerging market with enormous potential is mobile robots for entertainment. A fundamental requirement for autonomous mobile robots in most of its applications is the ability to navigate from a point of origin to a given goal. The mobile robot must be able to generate a collision-free path that connects the point of origin and the given goal. Some of the key algorithms for mobile robot navigation will be discussed in this article.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Optimizing Learning Weights of Back Propagation Using Flower Pollination Algorithm for Diabetes and Thyroid Data Classification
Local maxima are a point of a function with highest output (locally), while local minima are a point of a function with lowest output (also locally). Global maxima/minima, however, are different. They represent either the highest possible output of a function or the lowest possible output.
Full Text Chapter Download: US $37.50 Add to Cart
Neural Networks for Modeling the Contact Foot-Shoe Upper
Local minima of the error function. They do not correspond with the lowest value of the error but only with the lowest error within a limited range of values of the independent variables. Gradient-descent algorithms strongly depend on their initialization in order to avoid local minima.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR