Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

The Availability Heuristic01:08

The Availability Heuristic

6.9K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
6.9K
The Representativeness Heuristic02:13

The Representativeness Heuristic

16.7K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
16.7K
The Anchoring-and-Adjustment Heuristic01:25

The Anchoring-and-Adjustment Heuristic

7.7K
In order to make good decisions, we use our knowledge and our reasoning. Often, this knowledge and reasoning is sound and solid. However, sometimes, we are swayed by biases or by others manipulating a situation. For example, let’s say you and three friends wanted to rent a house and had a combined target budget of $1,600. The realtor shows you only very run-down houses for $1,600 and then shows you a very nice house for $2,000. Might you ask each person to pay more in rent to get the...
7.7K
Heuristics01:21

Heuristics

694
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
694
Mean free path and Mean free time01:22

Mean free path and Mean free time

5.1K
Consider the gas molecules in a cylinder. They move in a random motion as they collide with each other and change speed and direction. The average of all the path lengths between collisions is known as the "mean free path."
5.1K
Path Between Thermodynamics States01:21

Path Between Thermodynamics States

3.9K
Consider the two thermodynamic processes involving an ideal gas that are represented by paths AC and ABC in Figure 1:
3.9K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Pro-inflammatory microbiota mediates the effect of host risk genes in Crohn's disease.

Frontiers in microbiology·2026
Same author

Catalyst Layer Pore Design Based on Oxygen Mean Free Path for Low-Pt HT-PEMFCs.

Small (Weinheim an der Bergstrasse, Germany)·2026
Same author

Alkaloid-based nanodrug delivery systems: An emerging strategy against drug-resistant bacterial wound infections.

International journal of pharmaceutics: X·2026
Same author

Hydrophobic Capillary Ceramic-Membrane Contactor for Recovering Ammonia from Sludge Hydrolysate.

Membranes·2026
Same author

Hierarchical calibration based on multi-source noise dynamics unraveling for ultra-precision fluorescence lifetime measurement via a streak camera.

Applied optics·2026
Same author

Policy-Adjustable Q-Learning for Data-Driven Nonlinear Optimal Tracking Control.

IEEE transactions on neural networks and learning systems·2026
Same journal

DSPE-ViT: a lightweight vision transformer with dynamic sparse positional encoding for dense small object detection in UAV imagery.

Frontiers in neurorobotics·2026
Same journal

ST-HONet: Spatio-Temporal Hierarchical Network for long-horizon bimanual visuomotor imitation.

Frontiers in neurorobotics·2026
Same journal

ST-HADP: Spatio-Temporal hierarchical attention diffusion policy for long-horizon generalizable bimanual visuomotor imitation.

Frontiers in neurorobotics·2026
Same journal

EQISP: efficient quantized image signal processing with multi-scale pyramid fusion for resource constrained embodied perception.

Frontiers in neurorobotics·2026
Same journal

Research on embodied agent multimodal perception and real-time path planning algorithms for complex unstructured environments.

Frontiers in neurorobotics·2026
Same journal

NL-YOLOv5: a model with a larger receptive field and the ability to globally acquire features.

Frontiers in neurorobotics·2026
See all related articles

Related Experiment Video

Updated: Jan 25, 2026

Insect-controlled Robot: A Mobile Robot Platform to Evaluate the Odor-tracking Capability of an Insect
09:00

Insect-controlled Robot: A Mobile Robot Platform to Evaluate the Odor-tracking Capability of an Insect

Published on: December 19, 2016

15.2K

Mobile Robot Path Planning Based on Ant Colony Algorithm With A* Heuristic Method.

Xiaolin Dai1,2, Shuai Long1, Zhiwen Zhang1

  • 1School of Mechatronics Engineering, University of Electronic Science and Technology of China, Chengdu, China.

Frontiers in Neurorobotics
|May 7, 2019
PubMed
Summary
This summary is machine-generated.

This study introduces an enhanced ant colony algorithm (ACO) for mobile robot path planning in complex environments. The improved ACO offers faster convergence and smoother paths, outperforming traditional methods.

Keywords:
A* algorithmant colony algorithmbending suppressionpath planningretraction mechanism

More Related Videos

Collection and Long-Term Maintenance of Leaf-Cutting Ants Atta in Laboratory Conditions
10:11

Collection and Long-Term Maintenance of Leaf-Cutting Ants Atta in Laboratory Conditions

Published on: August 30, 2022

4.2K
Visual Classical Conditioning in Wood Ants
05:46

Visual Classical Conditioning in Wood Ants

Published on: October 5, 2018

8.9K

Related Experiment Videos

Last Updated: Jan 25, 2026

Insect-controlled Robot: A Mobile Robot Platform to Evaluate the Odor-tracking Capability of an Insect
09:00

Insect-controlled Robot: A Mobile Robot Platform to Evaluate the Odor-tracking Capability of an Insect

Published on: December 19, 2016

15.2K
Collection and Long-Term Maintenance of Leaf-Cutting Ants Atta in Laboratory Conditions
10:11

Collection and Long-Term Maintenance of Leaf-Cutting Ants Atta in Laboratory Conditions

Published on: August 30, 2022

4.2K
Visual Classical Conditioning in Wood Ants
05:46

Visual Classical Conditioning in Wood Ants

Published on: October 5, 2018

8.9K

Area of Science:

  • Robotics
  • Artificial Intelligence
  • Optimization Algorithms

Background:

  • Mobile robot navigation in complex environments presents significant path planning challenges.
  • Existing ant colony optimization (ACO) algorithms can suffer from slow convergence and suboptimal path generation.

Purpose of the Study:

  • To develop an improved ant colony algorithm (ACO) for efficient and smooth path planning in complex mobile robot navigation.
  • To enhance the heuristic information and pheromone update mechanisms of ACO for better performance.

Main Methods:

  • Integration of A* algorithm's evaluation function and a bending suppression operator to refine heuristic information.
  • Introduction of a retraction mechanism to address deadlock issues in path planning.
  • Modification of the MAX-MIN Ant System with local diffusion pheromones and limited pheromone trail strengths to prevent premature convergence.

Main Results:

  • The improved ACO demonstrates accelerated convergence speed and increased global path smoothness.
  • Effective performance in complex tunnel, trough, and baffle maps compared to traditional ACO versions.
  • Simulation results confirm the enhanced algorithm's superior efficiency and speed.

Conclusions:

  • The proposed enhanced ant colony algorithm significantly improves path planning efficiency and path quality for mobile robots in complex environments.
  • This approach offers a robust solution for navigation challenges, outperforming conventional ACO methods.