Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Collisions in Multiple Dimensions: Problem Solving

Collisions in Multiple Dimensions: Problem Solving

In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Relative Motion Analysis using Rotating Axes-Problem Solving

Relative Motion Analysis using Rotating Axes-Problem Solving

Consider a crane whose telescopic boom rotates with an angular velocity of 0.04 rad/s and angular acceleration of 0.02 rad/s2. Along with the rotation, the boom also extends linearly with a uniform speed of 5 m/s. The extension of the boom is measured at point D, which is measured with respect to the fixed point C on the other end of the boom. For the given instant, the distance between points C and D is 60 meters.
Here, in order to determine the magnitude of velocity and acceleration for point...

You might also read

Related Articles

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

Sort by

Same author

PM<sub>2.5</sub> promotes the phenotypic transition of vascular smooth muscle cells in atherosclerosis by activating pro-ferroptotic signaling via DRP1/PINK1/Parkin-dependent mitophagy.

Ecotoxicology and environmental safety·2026

Same author

PoGDiff: Product-of-Gaussians Diffusion Models for Imbalanced Text-to-Image Generation.

Advances in neural information processing systems·2026

Same author

Robust parameter estimation and variable selection in regression models for asymmetric heteroscedastic data.

Journal of applied statistics·2025

Same author

A Vehicle Routing Problem with Time Windows and Workload Balancing for COVID-19 Testers: A Case Study.

IFAC-PapersOnLine·2024

Same author

Hot-spots detection in count data by Poisson assisted smooth sparse tensor decomposition.

Journal of applied statistics·2023

Same author

A promising new tool for fault diagnosis of railway wheelset bearings: SSO-based Kurtogram.

ISA transactions·2021

Search research articles

Related Experiment Video

Updated: May 31, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity.

Yibiao Lu, Xiaoming Huo, O Arslan

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|June 22, 2011

Summary

This summary is machine-generated.

This study introduces an improved algorithm for dynamic shortest path-planning, enhancing efficiency in environments with changing edge weights. The new incremental multiscale algorithm offers better robustness and computational performance compared to existing methods.

Related Experiment Videos

Last Updated: May 31, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Area of Science:

Computer Science
Artificial Intelligence
Graph Theory

Background:

Path-planning is crucial for robotics, transportation, and VLSI design.
Dynamic shortest path-planning addresses changing environments, but existing algorithms like Lifelong Planning can be computationally intensive.
The performance of Lifelong Planning is sensitive to environmental changes, requiring significant vertex expansions.

Purpose of the Study:

To propose an extension of the Lifelong Planning algorithm for dynamic shortest path-planning.
To improve the robustness and computational complexity of dynamic path-planning algorithms.
To leverage multiscale representations for efficient environmental updates.

Main Methods:

An incremental multiscale (IM) algorithm is proposed, extending the baseline Lifelong Planning algorithm.
The IM algorithm utilizes a multiscale representation of the environment to efficiently localize changed edges.
This approach enables faster updates to the priority queue.

Main Results:

The IM algorithm demonstrates improved robustness and computational complexity compared to the classical Lifelong Planning algorithm.
Numerical experiments validate the efficiency gains of the proposed multiscale approach.
The algorithm effectively localizes changed edges and updates the priority queue.

Conclusions:

The incremental multiscale algorithm offers a more efficient and robust solution for dynamic shortest path-planning problems.
Multiscale representations are key to optimizing performance in dynamic graph environments.
This work provides a valuable advancement for applications requiring real-time path adjustments.