Files
kunpocc-behaviortree/src/behaviortree/BTNode/Composite.ts

147 lines
4.8 KiB
TypeScript
Raw Normal View History

2025-06-04 23:10:59 +08:00
import { Status } from "../header";
2025-09-02 17:05:46 +08:00
import { Composite, MemoryComposite } from "./AbstractNodes";
2025-06-04 23:10:59 +08:00
/**
*
2025-09-02 17:05:46 +08:00
* FAILURE
2025-06-04 23:10:59 +08:00
* Child Node返回不为 FAILURE, Node向自己的Parent Node也返回Child Node状态
*/
2025-09-02 17:05:46 +08:00
export class MemSelector extends MemoryComposite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
let index = this.get<number>(`__nMemoryRunningIndex`);
for (let i = index; i < this.children.length; i++) {
let status = this.children[i]!._execute();
2025-06-04 23:10:59 +08:00
if (status !== Status.FAILURE) {
if (status === Status.RUNNING) {
2025-09-03 10:54:07 +08:00
this.set(`__nMemoryRunningIndex`, i);
2025-06-04 23:10:59 +08:00
}
return status;
}
}
return Status.FAILURE;
}
}
/**
*
2025-09-02 17:05:46 +08:00
* RUNNING , , RUNNING
* SUCCESS FAILURE
2025-06-04 23:10:59 +08:00
* Child Node返回不为 SUCCESS, Node向自己的Parent Node也返回Child Node状态
* SUCCESS, SUCCESS
*/
2025-09-02 17:05:46 +08:00
export class MemSequence extends MemoryComposite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
let index = this.get<number>(`__nMemoryRunningIndex`);
for (let i = index; i < this.children.length; i++) {
let status = this.children[i]!._execute();
2025-06-04 23:10:59 +08:00
if (status !== Status.SUCCESS) {
if (status === Status.RUNNING) {
2025-09-03 10:54:07 +08:00
this.set(`__nMemoryRunningIndex`, i);
2025-06-04 23:10:59 +08:00
}
return status;
}
}
return Status.SUCCESS;
}
}
/**
*
* Child Node中随机选择一个执行
*/
export class RandomSelector extends Composite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
2025-09-02 17:05:46 +08:00
if (this.children.length === 0) {
return Status.FAILURE;
}
2025-06-04 23:10:59 +08:00
2025-09-02 17:05:46 +08:00
const childIndex = Math.floor(Math.random() * this.children.length);
2025-09-03 10:54:07 +08:00
const status = this.children[childIndex]!._execute();
2025-06-04 23:10:59 +08:00
return status;
}
}
/**
* FAILURE
2025-09-02 17:05:46 +08:00
* Node时begin到end迭代执行自己的Child Node
* Child Node执行后返回 SUCCESS RUNNINGNode向自己的Parent Node也返回 SUCCESS RUNNING
2025-06-04 23:10:59 +08:00
*/
export class Selector extends Composite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
2025-06-04 23:10:59 +08:00
for (let i = 0; i < this.children.length; i++) {
2025-09-03 10:54:07 +08:00
let status = this.children[i]!._execute();
2025-06-04 23:10:59 +08:00
if (status !== Status.FAILURE) {
return status;
}
}
return Status.FAILURE;
}
}
/**
*
* Node时begin到end迭代执行自己的Child Node
2025-09-02 17:05:46 +08:00
* FAILURE RUNNING, FAILURE RUNNING
2025-06-04 23:10:59 +08:00
* SUCCESS, SUCCESS
*/
export class Sequence extends Composite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
2025-06-04 23:10:59 +08:00
for (let i = 0; i < this.children.length; i++) {
2025-09-03 10:54:07 +08:00
let status = this.children[i]!._execute();
2025-06-04 23:10:59 +08:00
if (status !== Status.SUCCESS) {
return status;
}
}
return Status.SUCCESS;
}
}
/**
2025-09-03 10:54:07 +08:00
*
* begin到end迭代执行自己的Child Node
* 1. FAILURE, FAILURE
* 2. RUNNING, RUNNING
* 3. , SUCCESS
2025-06-04 23:10:59 +08:00
*/
export class Parallel extends Composite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
2025-06-04 23:10:59 +08:00
let result = Status.SUCCESS;
for (let i = 0; i < this.children.length; i++) {
2025-09-03 10:54:07 +08:00
let status = this.children[i]!._execute();
if (result === Status.FAILURE || status === Status.FAILURE) {
2025-06-04 23:10:59 +08:00
result = Status.FAILURE;
2025-09-03 10:54:07 +08:00
continue;
}
if (status === Status.RUNNING) {
2025-06-04 23:10:59 +08:00
result = Status.RUNNING;
2025-09-03 10:54:07 +08:00
continue;
2025-06-04 23:10:59 +08:00
}
}
return result;
}
}
/**
*
2025-09-03 10:54:07 +08:00
* begin到end迭代执行自己的Child Node
* 1. SUCCESS, SUCCESS
* 2. , FAILURE, FAILURE
2025-06-04 23:10:59 +08:00
* RUNNING
*/
export class ParallelAnySuccess extends Composite {
2025-09-03 10:54:07 +08:00
public tick(): Status {
2025-06-04 23:10:59 +08:00
let result = Status.RUNNING;
for (let i = 0; i < this.children.length; i++) {
2025-09-03 10:54:07 +08:00
let status = this.children[i]!._execute();
if (result === Status.SUCCESS || status === Status.SUCCESS) {
2025-06-04 23:10:59 +08:00
result = Status.SUCCESS;
2025-09-03 10:54:07 +08:00
continue;
}
if (status === Status.FAILURE) {
result = Status.FAILURE;
continue;
2025-06-04 23:10:59 +08:00
}
}
return result;
}
}