latest pushes
This commit is contained in:
160
README.md
160
README.md
@@ -1,16 +1,5 @@
|
||||
# 📦 Bellande Limit
|
||||
|
||||
|
||||
|
||||
## Preprint
|
||||
- [](https://dapp.orvium.io/deposits/6650ccb8afb407dc8beb0ff2/view)
|
||||
|
||||
# Preprint Citation
|
||||
```
|
||||
Bellande, R. (2024). Efficient Step Function for Infinite Multi-Dimensional Node Calculation within Model-Integrated Dimensional Space [version 1] [preprint]. Mathematics.
|
||||
```
|
||||
|
||||
|
||||
## 🧙 Organization Website
|
||||
- [](https://robotics-sensors.github.io)
|
||||
|
||||
@@ -21,7 +10,7 @@ Bellande, R. (2024). Efficient Step Function for Infinite Multi-Dimensional Node
|
||||
- **Ronaldson Bellande**
|
||||
|
||||
## Bellande Limit Executables & Models
|
||||
- [](https://github.com/Artificial-Intelligence-Computer-Vision/bellande_step_models_executables)
|
||||
- [](https://github.com/Artificial-Intelligence-Computer-Vision/bellande_limit_models_executables)
|
||||
|
||||
# API HTTP Usability (BELLANDE FORMAT)
|
||||
```
|
||||
@@ -80,7 +69,15 @@ Bellande_Framework_Access_Key: bellande_web_api_opensource
|
||||
{
|
||||
"node0": [0, 0, 0],
|
||||
"node1": [100, 100, 100],
|
||||
"environment": [1000, 1000, 1000],
|
||||
"size": [10, 10, 10],
|
||||
"goal": [200, 200, 200],
|
||||
"obstacles": [
|
||||
{
|
||||
"position": [50, 50, 50],
|
||||
"dimensions": [20, 20, 20]
|
||||
}
|
||||
],
|
||||
"search_radius": 50,
|
||||
"sample_points": 20,
|
||||
"auth": {
|
||||
@@ -90,7 +87,7 @@ Bellande_Framework_Access_Key: bellande_web_api_opensource
|
||||
```
|
||||
|
||||
# 🧙 Website Bellande API Testing
|
||||
- [](https://bellanderoboticssensorsresearchinnovationcenterwebsite-kot42qxp.b4a.run/api/bellande_step_experiment)
|
||||
- [](https://bellande-robotics-sensors-research-innovation-center.org/api/bellande_limit_experiment)
|
||||
|
||||
# Quick Bellande API Testing
|
||||
```
|
||||
@@ -101,7 +98,15 @@ curl -X 'POST' \
|
||||
-d '{
|
||||
"node0": [0, 0, 0],
|
||||
"node1": [100, 100, 100],
|
||||
"environment": [1000, 1000, 1000],
|
||||
"size": [10, 10, 10],
|
||||
"goal": [100, 100, 100],
|
||||
"obstacles": [
|
||||
{
|
||||
"position": [50, 50, 50],
|
||||
"dimensions": [20, 20, 20]
|
||||
}
|
||||
],
|
||||
"search_radius": 50,
|
||||
"sample_points": 20,
|
||||
"auth": {
|
||||
@@ -110,132 +115,6 @@ curl -X 'POST' \
|
||||
}'
|
||||
```
|
||||
|
||||
# BS(Bellande Step) Algorithm API
|
||||
## Experiment 1 -- Limit = 1
|
||||
|
||||
|  *Figure 2D* |  *Figure 3D* |  *Figure 4D* |
|
||||
|:------------------------------------------------------------:|:------------------------------------------------------------:|:------------------------------------------------------------:|
|
||||
|  *Figure 5D* |  *Figure 6D* |  *Figure 7D* |
|
||||
|  *Figure 8D* |  *Figure 9D* |  *Figure 10D* |
|
||||
|
||||
|
||||
## Experiment 2 -- Limit = 25
|
||||
|
||||
|  *Figure 2D* |  *Figure 3D* |  *Figure 4D* |
|
||||
|:-------------------------------------------------------------:|:-------------------------------------------------------------:|:-------------------------------------------------------------:|
|
||||
|  *Figure 5D* |  *Figure 6D* |  *Figure 7D* |
|
||||
|  *Figure 8D* |  *Figure 9D* |  *Figure 10D* |
|
||||
|
||||
|
||||
## Experiment 3 -- Limit = 50
|
||||
|
||||
|  *Figure 2D* |  *Figure 3D* |  *Figure 4D* |
|
||||
|:-------------------------------------------------------------:|:-------------------------------------------------------------:|:-------------------------------------------------------------:|
|
||||
|  *Figure 5D* |  *Figure 6D* |  *Figure 7D* |
|
||||
|  *Figure 8D* |  *Figure 9D* |  *Figure 10D* |
|
||||
|
||||
|
||||
## Experiment 4 -- Limit = 75
|
||||
|
||||
|  *Figure 2D* |  *Figure 3D* |  *Figure 4D* |
|
||||
|:-------------------------------------------------------------:|:-------------------------------------------------------------:|:-------------------------------------------------------------:|
|
||||
|  *Figure 5D* |  *Figure 6D* |  *Figure 7D* |
|
||||
|  *Figure 8D* |  *Figure 9D* |  *Figure 10D* |
|
||||
|
||||
|
||||
## Experiment 5 -- Limit = 100
|
||||
|
||||
|  *Figure 2D* |  *Figure 3D* |  *Figure 4D* |
|
||||
|:--------------------------------------------------------------:|:--------------------------------------------------------------:|:--------------------------------------------------------------:|
|
||||
|  *Figure 5D* |  *Figure 6D* |  *Figure 7D* |
|
||||
|  *Figure 8D* |  *Figure 9D* |  *Figure 10D* |
|
||||
|
||||
|
||||
|
||||
# Check Out Research Organization for open-source/semi-open-source API
|
||||
- https://robotics-sensors.github.io
|
||||
- Check out website for more information avaliable open-source API
|
||||
|
||||
# Package via Executable
|
||||
- Infinite Space
|
||||
|
||||
```
|
||||
bellande_step "[0, 0, 0]" "[100, 100, 100]" 75 3
|
||||
```
|
||||
# API in api_docs
|
||||
- 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](https://github.com/Robotics-Sensors/bellande_robots_step/blob/main/api_docs.md)
|
||||
### ✔️ 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.
|
||||
|
||||
```python
|
||||
# Define Import
|
||||
from bellande_step.bellande_step_2d import bellande_step_2d
|
||||
|
||||
# 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.
|
||||
|
||||
```python
|
||||
# Define Import
|
||||
from bellande_step.bellande_step_3d import bellande_step_3d
|
||||
|
||||
# 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 PYPI
|
||||
- https://pypi.org/project/bellande_limit
|
||||
|
||||
@@ -247,9 +126,8 @@ print("Next Step Coordinates:", next_step.coord)
|
||||
|
||||
```
|
||||
Name: bellande_limit
|
||||
Version: 0.3.0
|
||||
Summary: Computes the next step towards a target node
|
||||
Home-page: github.com/RonaldsonBellande/bellande_robot_step
|
||||
Home-page: github.com/RonaldsonBellande/bellande_limit
|
||||
Author: Ronaldson Bellande
|
||||
Author-email: ronaldsonbellande@gmail.com
|
||||
License: GNU General Public License v3.0
|
||||
|
||||
Reference in New Issue
Block a user