본문으로 건너뛰기
cccskills
무료GitHub에 공개

bevy-navigation

Bevy ECS skill for navigation. Keywords: Bevy, navigation, pathfinding, ECS.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

설치 방법 보기

포함된 파일(2)

  • SKILL.md9.7 KB
  • references/ecs-ownership.md529 B

SKILL.md(원문)

설치하기 전에 에이전트에게 전달되는 지시 내용을 확인할 수 있습니다.

Bevy navigation

When to use

Load this when agents need a path over walkable space before adding a crate. Movement of the actor after a path exists belongs on bevy-character-movement. Policy for chase, patrol, and retarget belongs on bevy-ai-navigation.

ECS shape

  • Components store the goal cell and the waypoint list for one agent.
  • Resources own the walk grid: width, height, and blocked cells.
  • Systems search on Update, then step along the path on FixedUpdate. .chain() keeps the new path visible before motion.
  • Schedule: search and follow stay on the app schedules above. Crowd policy stays on bevy-ai-navigation.

Ownership

NeedBevy shape
AgentAn entity with a goal and a waypoint list
Walkable spaceA WalkGrid resource of blocked cells
AvoidanceSeparation stays on bevy-ai-navigation
Next waypointAgentPath stepped on FixedUpdate

Scope

  • A grid, a breadth-first search, and a follower are enough for walkable cells. Navmesh baking and crowd radius stay outside this skill.
  • Actor locomotion after a waypoint exists belongs on bevy-character-movement.

Examples

[package]
name = "navigation"
version = "0.1.0"
edition = "2021"

[dependencies]
bevy = "0.20"

The grid is a resource. Search writes waypoints. The follower consumes them on the fixed step.

use std::collections::VecDeque;

#[derive(Resource)]
struct WalkGrid {
    width: i32,
    height: i32,
    cell: f32,
    blocked: Vec<bool>,
}

#[derive(Component)]
struct GoalCell(i32, i32);

#[derive(Component)]
struct AgentPath {
    waypoints: Vec<Vec3>,
    index: usize,
}

fn cell_index(grid: &WalkGrid, x: i32, y: i32) -> Option<usize> {
    if x < 0 || y < 0 || x >= grid.width || y >= grid.height {
        return None;
    }
    Some((y * grid.width + x) as usize)
}

fn search(grid: &WalkGrid, start: (i32, i32), goal: (i32, i32)) -> Vec<Vec3> {
    let Some(start_i) = cell_index(grid, start.0, start.1) else {
        return Vec::new();
    };
    if grid.blocked[start_i] {
        return Vec::new();
    }
    let mut prev: Vec<Option<(i32, i32)>> = vec![None; grid.blocked.len()];
    let mut queue = VecDeque::new();
    prev[start_i] = Some(start);
    queue.push_back(start);
    while let Some((x, y)) = queue.pop_front() {
        if (x, y) == goal {
            break;
        }
        for (nx, ny) in [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)] {
            let Some(i) = cell_index(grid, nx, ny) else {
                continue;
            };
            if grid.blocked[i] || prev[i].is_some() {
                continue;
            }
            prev[i] = Some((x, y));
            queue.push_back((nx, ny));
        }
    }
    let Some(_) = cell_index(grid, goal.0, goal.1).filter(|i| prev[*i].is_some()) else {
        return Vec::new();
    };
    let mut cells = Vec::new();
    let mut cursor = goal;
    cells.push(cursor);
    while cursor != start {
        let Some(i) = cell_index(grid, cursor.0, cursor.1) else {
            break;
        };
        let Some(parent) = prev[i] else {
            break;
        };
        if parent == cursor {
            break;
        }
        cursor = parent;
        cells.push(cursor);
    }
    cells.reverse();
    cells
        .into_iter()
        .map(|(x, y)| Vec3::new(x as f32 * grid.cell, 0.0, y as f32 * grid.cell))
        .collect()
}

fn plan_paths(
    grid: Res<WalkGrid>,
    mut agents: Query<(&Transform, Ref<GoalCell>, &mut AgentPath)>,
) {
    let grid_changed = grid.is_changed();
    for (tf, goal, mut path) in &mut agents {
        if !grid_changed && !goal.is_changed() {
            continue;
        }
        let start = (
            (tf.translation.x / grid.cell).floor() as i32,
            (tf.translation.z / grid.cell).floor() as i32,
        );
        path.waypoints = search(&grid, start, (goal.0, goal.1));
        path.index = 0;
    }
}

fn follow_paths(time: Res<Time<Fixed>>, mut agents: Query<(&mut Transform, &mut AgentPath)>) {
    let step = 4.0 * time.delta_secs();
    for (mut tf, mut path) in &mut agents {
        let Some(goal) = path.waypoints.get(path.index).copied() else {
            continue;
        };
        let delta = goal - tf.translation;
        let dist = delta.length();
        if dist <= step || dist == 0.0 {
            tf.translation = goal;
            path.index += 1;
        } else {
            tf.translation += delta / dist * step;
        }
    }
}

pub struct NavigationPlugin;

impl Plugin for NavigationPlugin {
    fn build(&self, app: &mut App) {
        let width = 8;
        let height = 8;
        app.insert_resource(WalkGrid {
            width,
            height,
            cell: 1.0,
            blocked: vec![false; (width * height) as usize],
        })
        .add_systems(Update, plan_paths)
        .add_systems(FixedUpdate, follow_paths);
    }
}

Mark a cell blocked and give an agent a goal. Planning runs again because the grid resource changed.

#[derive(Resource)]
struct WalkGrid {
    width: i32,
    height: i32,
    cell: f32,
    blocked: Vec<bool>,
}

#[derive(Component)]
struct GoalCell(i32, i32);

#[derive(Component)]
struct AgentPath {
    waypoints: Vec<Vec3>,
    index: usize,
}

fn block_cell(mut grid: ResMut<WalkGrid>) {
    let x = 2;
    let y = 3;
    let i = (y * grid.width + x) as usize;
    if let Some(cell) = grid.blocked.get_mut(i) {
        *cell = true;
    }
}

fn spawn_agent(mut commands: Commands) {
    commands.spawn((
        Transform::from_xyz(0.0, 0.0, 0.0),
        GoalCell(5, 5),
        AgentPath {
            waypoints: Vec::new(),
            index: 0,
        },
    ));
}

Expert Knowledge Delta

Target: Bevy 0.20+.

Core ECS types: Component, Resource, Query, Commands, Startup, Update, Fixed / FixedMain (bevy::time), .chain(), Plugin, DefaultPlugins, MinimalPlugins. Messages and observers are an ownership slot. See bevy-events-messaging for their APIs. Systems run in parallel unless .chain() orders the ones that conflict.

Who owns state

PieceOwnerWho may mutateSchedule
Data on one entityComponentOne system via QueryUpdate or FixedMain
One value for the whole appResourceOne systemStartup to insert, then the schedule that reads it
SpawnCommandsThe spawning systemStartup for the initial world; later schedules for runtime spawn
Order that must not race.chain()The chained systems onlySame schedule
Plugin boundaryPluginbuild registers systems and resourcesBefore the app runs

Borrow rule: two systems that both mutably query the same component must be ordered (.chain()) or split so only one writes. Unrelated systems stay parallel. That is the ECS page rule, not a guess at a system-set API.

Decision

If you needDo thisDo not
Per-entity dataComponent + QueryA field stored outside a component
App-wide config or clockResourceCopy the value onto every entity
Stable simulation stepFixedMain and the Fixed clockTie simulation to raw frame Update
Startup spawnCommands in StartupSpawn from a render system
Cross-system notice that is not shared stateMessage or observer slot in bevy-events-messagingA new event type invented in this file
A path over cellsWalkGrid plus breadth-first searchAn engine navmesh type this crate does not ship

Load references/ecs-ownership.md for the ownership table.

NEVER

  • Do not pin /0.20.0/ in docs URLs. WHY: links stay on latest; the 0.20 target is stated once in prose.

  • Do not mutably query the same component from two unordered systems. WHY: the schedule runs systems in parallel unless .chain() orders them.

  • Do not invent a physics, navigation, networking, or XR crate here. WHY: this skill only names documented Bevy crates and modules.

  • No navigation types from another engine. WHY: Bevy code stays idiomatic ECS and uses only documented Bevy APIs.

  • No named third-party navigation crate as the chosen solver. WHY: Bevy code stays idiomatic ECS and uses only documented Bevy APIs.

  • No invented bake, avoidance, or path-query APIs. WHY: Bevy code stays idiomatic ECS and uses only documented Bevy APIs.

Reference

Official links stay on bevy.org. The library pin on bevy-master stays 0.20. No navigation module was opened.

Official Documentation

  • Assets - Official asset catalog. No navigation plugin was selected.
  • Examples - Example tree on the latest branch.
  • ECS - Component, Query, Commands, and .chain().
  • Quick Start: plugins - add_plugins without a chosen nav crate.

Related Skills

Prerequisites

Complements

Downstream / consumers

  • Genre skills route chase, patrol, and similar policies.

Master

리뷰

아직 리뷰가 없습니다. 사용해 본 소감을 남겨 주세요.

댓글

로그인 없이 쓸 수 있습니다. 사용 후기, 질문, 작동하지 않은 환경 등을 편하게 남겨 주세요.

아직 댓글이 없습니다. 첫 댓글을 남겨 보세요.

보내면 바로 공개됩니다. 이메일 주소나 전화번호 같은 개인 정보는 쓰지 마세요. URL은 2개까지입니다.

0 / 1,000자

이 양식은 reCAPTCHA로 보호되며 Google 개인정보처리방침 및 서비스 약관이 적용됩니다.

같은 저장소의 스킬

Bevy ECS skill for 2D sprite animation. Keywords: Bevy, sprite, animation, AnimationPlayer, AnimationClip, 2D.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

Spawn and tune Bevy 0.20 directional, point, and spot lights, cascade shadows, distance fog, and a nearest-light shadow budget. Use when a 3D scene needs a sun, local lights, or fog on the camera. Keywords: DirectionalLight, PointLight, SpotLight, CascadeShadowConfig, DistanceFog, bevy_light.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

Bevy ECS skill for PBR materials. Keywords: Bevy, StandardMaterial, PBR, material, ExtendedMaterial.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

Bevy ECS skill for 3D level assembly. Keywords: Bevy, level, scene, mesh, world, ECS.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

Bevy ECS skill for abilities. Keywords: Bevy, ability, cooldown, ECS, gameplay.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

Rewrite Bevy 2D actors and cameras into 3D meshes and Camera3d while keeping gameplay components. Use when a Bevy 2D game should gain a perspective camera, mesh draw, and a planar velocity lifted onto XZ. Keywords: Camera2d, Camera3d, Sprite, Mesh3d, StandardMaterial, WishVelocity.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

thedivergentai/Game-Dev-Agentic-Skills8772026년 10월 17일 업데이트

thedivergentai의 스킬 모두 보기

이 스킬의 문제 신고