本文整理汇总了Python中state.State.set_g方法的典型用法代码示例。如果您正苦于以下问题：Python State.set_g方法的具体用法？Python State.set_g怎么用？Python State.set_g使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类state.State的用法示例。
在下文中一共展示了State.set_g方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: addForbidden
# 需要导入模块: from state import State [as 别名]
# 或者: from state.State import set_g [as 别名]
def addForbidden(self,point):
if point in self.forbidden:
return self.eps
self.forbidden.add(point)
state = State(point)
if self.G.has_key(state):
state = self.G[state]
else:
return self.eps
toUpdate = []
start_fix=None
HOLD_OPEN=self.OPEN
HOLD_CLOSED=self.CLOSED
HOLD_INCS=self.INCONS
goal_temp = None
Exper =True
mr= self.eps
state.setCost(10000000.0)
state.set_g(10000000.0)
if self.path_.has_key(state):
mr = self.eps+10
for aS in state.successors:
self.__build_state__(aS)
aS.remove_successor(state)
toUpdate.append(aS)
for aS in toUpdate:
#aS.set_start(self.s_start)
self.UpdateState(aS)
return mr
"""if self.path_.has_key(state) and True==Exper :示例2: __init__
# 需要导入模块: from state import State [as 别名]
# 或者: from state.State import set_g [as 别名]
class AnytimeDstar:
"""
Main portion of algorithm.
"""
def __init__(self,start,goal,state_trans,forbidden=set()):
self.OPEN = priorityDictionary()
self.INCONS= set()
self.CLOSED = set()
self.s_start = State(start,start,goal)
self.s_start.set_rhs(constants.INF)
self.s_start.set_g(constants.INF)
self.s_goal = State(goal,start,goal)
self.s_goal.set_g(constants.INF)
self.s_goal.set_rhs(0)
self.eps = 2.5 # TODO make it change during iterations.
self.PREC = {}
self.G = {}
self.path_= {}
self.G[self.s_start] = self.s_start
self.forbidden = forbidden#TODO add "obstacles"
self.OPEN[self.s_goal] = self.keys(self.s_goal)
self.state_trans= state_trans
def __build_state__(self,s):
""" Utility method to build up a unvisited state"""
if not self.G.has_key(s):
self.G[s]= s
if s.successors!=None:
return
values= self.state_trans.state_trans_fuction(s.point)
hold_v = copy.deepcopy(values)
for x in values:
if x in self.forbidden:
hold_v.remove(x)
s.successors = set()
for x in hold_v:
newstate = State(x,self.s_start.point,self.s_goal.point)
if self.G.has_key(newstate):
newstate = self.G[newstate]
self.G[newstate]= newstate
s.successors.add(newstate)
def get_start(self):
return self.s_start
def keys(self,s): #state
if s.g()>s.rhs():
return Key([ s.rhs() + self.eps*s.h(),s.rhs()])
else:
return Key([ s.g() + s.h(),s.g()])
def UpdateAllPriorities(self):
states= [s for s in self.OPEN]
for s in states:
self.OPEN[s] = self.keys(s)
def UpdateState(self,s):
if not s.isGoal():
s.set_rhs(s.min_of_successors())
if s in self.OPEN :
self.OPEN.remove(s)
if s.g()!=s.rhs():
if not s in self.CLOSED:
self.OPEN[s] = self.keys(s)
else:
self.INCONS.add(s)
def isConsistent(self,state):
if state.g() > state.rhs():
state.set_g(state.rhs())
self.CLOSED.add(state)
return True
else:
state.set_g(2*constants.INF)
return False
"""
This allows to fix the path around when a path has been broken by an
obstacle.
"""
def __ImprovePath__(self,start):
states = 0
while len(self.OPEN)>0 and ( self.keys(self.OPEN.smallest())<self.keys(start) \
or start.g()!= start.rhs()):
#print self.keys(self.OPEN.smallest()) , "----",self.keys(self.s_start)
hold_state = self.OPEN.smallest()
print hold_state
#TODO debug methods
states+=1
self.OPEN.remove(hold_state)
self.__build_state__(hold_state)
if self.isConsistent(hold_state):
for aState in hold_state.successors:
self.__build_state__(aState)
aState.set_start(start)
self.UpdateState(aState)
else:
self.UpdateState(hold_state)
for aState in hold_state.successors:
self.__build_state__(aState)
aState.set_start(start)
self.UpdateState(aState)
return states
def ComputeorImprovePath(self):
#.........这里部分代码省略.........