From 2d4d3cc82de806dfeaf67de6316116d7bc88565a Mon Sep 17 00:00:00 2001
From: Caiyishuai <39987654+Caiyishuai@users.noreply.github.com>
Date: Mon, 6 Nov 2023 17:41:25 +0800
Subject: [PATCH] =?UTF-8?q?=F0=9F=93=A6=20NEW:=20=E5=AE=8C=E5=85=A8?=
 =?UTF-8?q?=E6=9C=80=E4=BC=98=E8=A1=8C=E4=B8=BA=E6=A0=91=E6=89=A9=E5=B1=95?=
 =?UTF-8?q?=E7=AE=97=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 opt_bt_expansion/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/opt_bt_expansion/README.md b/opt_bt_expansion/README.md
index 13791d1..7378773 100644
--- a/opt_bt_expansion/README.md
+++ b/opt_bt_expansion/README.md
@@ -102,6 +102,7 @@ print(ptml_string)
 ```python
 # 判断初始状态能否到达目标状态
 start = {'At(Robot,Bar)', 'Holding(VacuumCup)', 'Available(Table)', 'Available(CoffeeMachine)','Available(FrontDesk)'}
+
 # 方法一：算法返回所有可能的初始状态，在里面看看有没有对应的初始状态
 right_bt = algo.find_all_leaf_states_contain_start(start)
 if not right_bt:
@@ -109,7 +110,6 @@ if not right_bt:
 else:
     print("Right1: The current state can reach the goal state!")
 
-
 # 方法二：预先跑一边行为树，看能否到达目标状态
 right_bt2 = algo.run_bt_from_start(goal,start)
 if not right_bt2: