Bellande Step Algorithm that efficiently computes the next step towards a target with directionality and segmentation capabilities
Go to file
2024-06-06 17:02:05 -04:00
graphs_charts charts 2024-06-06 17:02:05 -04:00
.gitignore charts 2024-06-06 17:02:05 -04:00
api_docs.md recal 2024-03-18 01:33:59 -04:00
LICENSE Update LICENSE 2024-04-23 15:43:31 -04:00
README.md charts 2024-06-06 17:02:05 -04:00

📦 Bellande Step

BS(Bellande Step) Algorithm API

Experiment 1

2D Figure 2D

3D Figure 3D

4D Figure 4D

5D Figure 5D

6D Figure 6D

7D Figure 7D

8D Figure 8D

9D Figure 9D

10D Figure 10D

Experiment 2

2D Figure 2D

3D Figure 3D

4D Figure 4D

5D Figure 5D

6D Figure 6D

7D Figure 7D

8D Figure 8D

9D Figure 9D

10D Figure 10D

Experiment 3

2D Figure 2D

3D Figure 3D

4D Figure 4D

5D Figure 5D

6D Figure 6D

7D Figure 7D

8D Figure 8D

9D Figure 9D

10D Figure 10D

Experiment 4

2D Figure 2D

3D Figure 3D

4D Figure 4D

5D Figure 5D

6D Figure 6D

7D Figure 7D

8D Figure 8D

9D Figure 9D

10D Figure 10D

Experiment 5

2D Figure 2D

3D Figure 3D

4D Figure 4D

5D Figure 5D

6D Figure 6D

7D Figure 7D

8D Figure 8D

9D Figure 9D

10D Figure 10D

Check Out Research Organization for open-source/semi-open-source API

API in api_docs

  • Temporarily Enabled
  • 2D Space
  • 3D Space
  • 4D Space
  • 5D Space
  • 6D Space
  • 7D Space
  • 8D Space
  • 9D Space
  • 10D Space

Can also checkout portion of the docs at Portion API DOCS

✔️ confirmed versions

  • The step function efficiently computes the next step towards a target node within a specified distance limit.

Usage 2D Space

Suppose you have two nodes representing positions in a 2D space:

  • node0 at coordinates (0, 0)
  • node1 at coordinates (5, 5)

You want to compute the next step from node0 towards node1 while limiting the maximum distance to 3 units.

# Define Import 
from bellande_robot_step.bellande_robot_step_2d import bellande_step_2d, Node2D

# Define the nodes
node0 = Node2D(0, 0)
node1 = Node2D(5, 5)

# Compute the next step within a distance limit of 3 units
next_step = bellande_step_2d(node0, node1, limit=3)

# Output the coordinates of the next step
print("Next Step Coordinates:", next_step.coord) 

Usage 3D Space

Suppose you have two nodes representing positions in a 3D space:

  • node0 at coordinates (0, 0, 0)
  • node1 at coordinates (5, 5, 5)

You want to compute the next step from node0 towards node1 while limiting the maximum distance to 3 units.

# Define Import 
from bellande_robot_step.bellande_robot_step_3d import bellande_step_3d, Node3D 

# Define the nodes
node0 = Node3D(0, 0, 0)
node1 = Node3D(5, 5, 5)

# Compute the next step within a distance limit of 3 units
next_step = bellande_step_3d(node0, node1, limit=3)

# Output the coordinates of the next step
print("Next Step Coordinates:", next_step.coord)

Avaliable

  • 2D Space
  • 3D Space
  • 4D Space
  • 5D Space
  • 6D Space
  • 7D Space
  • 8D Space
  • 9D Space
  • 10D Space

Website

Installation

  • $ pip install bellande_robot_step

Upgrade (if not upgraded)

  • $ pip install --upgrade bellande_robot_step
Name: bellande_robot_step
Version: 0.3.0
Summary: Computes the next step towards a target node
Home-page: github.com/RonaldsonBellande/bellande_robot_step
Author: Ronaldson Bellande
Author-email: ronaldsonbellande@gmail.com
License: GNU General Public License v3.0
Requires: numpy
Required-by:

License

This Algorithm or Models is distributed under the Creative Commons Attribution-ShareAlike 4.0 International License, see LICENSE and NOTICE for more information.